Ad-hoc network acquisition using chaotic sequence spread waveform

ABSTRACT

Method and system for identifying neighbor nodes in an ad-hoc wireless network including two or more nodes. The method involves generating a beacon signal at a first node of the network for alerting other nodes in the network of the presence of the first node. A digitally generated first spreading sequence is also generated at the first node. Thereafter, the beacon signal is modulated with the first spreading sequence to produce a spread spectrum signal which is then transmitted. The spreading sequence is selected to be a chaotic sequence.

BACKGROUND OF THE INVENTION

1. Statement of the Technical Field

The inventive arrangements concern wireless networks. More particularly,the invention relates to a system and method for the detection ofwireless network nodes existing within a communications range.

2. Description of the Related Art

Wireless ad-hoc networks are known in the art. They generally include aclass of networks in which wireless communications are used to link aplurality of nodes, which can be mobile. The term “node” as used hereinrefers to a device configured to establish a connection to anotherdevice in a wireless network. Such devices often include servers,handheld communications devices, mounted communications devices, sensordevices, relay devices, coordination devices, satellites and the like.Each node includes a transmitter and receiver. Significantly, each nodecan function as a router and/or as a host. In operation, each node isconfigured to communicate directly with other nodes (i.e. without theuse of a centralized access point). The topology of the ad-hoc networkis not fixed and various nodes automatically reconfigure themselves tofunction as routers on an as needed basis. Packetized data communicatedin the network can travel from a source node to a destination nodeeither directly, or through some set of intermediate packet forwardingnodes.

In order for an ad-hoc network to function properly, the nodes must beable to identify the presence of neighboring nodes in the network.Consequently, nodes are typically configured to execute a definedprocedure to locate unconnected nodes in the network and determine pathsthrough the network through which data traffic can be communicated froma source node to a destination node. These procedures can also be usefulfor detecting the departure of nodes from the network and identifyingalternative paths through the network when such departures do occur.

One common method for identifying neighbor nodes involves the use of“beacons”. The term “beacon” as used herein refers to any wirelesscommunication that is generated by a network node, and which can bepotentially received by some or all nodes comprising the network forpurposes of initiating discovery of unconnected nodes in the network.Thus, the beacon transmission is not necessarily intended to be receivedby any particular node, but can instead be selected so it can bereceived by any node within transmission range of the source node.Various types of information are advantageously included within thebeacon signal. For example, the beacon signal can identify the source ofthe beacon signal by means of some identification code, can identifytransmission and receive frequencies to be used, and various othercommunication protocols.

Various different types of beacon systems have been devised for use inad-hoc networks. Some systems use only a limited number of selectednodes in the network to perform the beacon function whereas in othersystems, all nodes can transmit a beacon. Some systems transmit a beaconsignal in an omni-directional pattern to communicate with nodes in alldirections. Other systems use a sectorized approach to selectivelytransmit a beacon signal only in pre-defined directions. When a beaconsignal is received by a neighboring node, the beacon indicates to thereceiving node that a neighbor node is present. Still other networks aredesigned to use a periphery-based approach where designated nodeslocated near peripheral areas of the network are selected to performnetwork acquisition processing for the entire network.

Neighbor discovery in an ad-hoc network is a key step to establishingnetwork communications. Accordingly, beacon signals must be sent in sucha way as to ensure a high likelihood that they will be received by othernodes in the network. In this regard, it is often desirable to transmitbeacon signals at well defined intervals and relatively high powerlevels. Consequently, the beacon transmissions are very much subject todetection and interception by adversaries. Notably, in a combatenvironment, an adversary can exploit this information in a variety ofways. Therefore, a need exists for systems and methods to enable nodesto perform neighbor discovery with a low probability of exploitation.

One method for minimizing detection and interception of beacon signalsinvolves the use of spreading sequences, which distribute the energy ofthe beacon signal over a wide bandwidth. Such a system is described inU.S. Pat. No. 7,269,198 to Elliott et al. The system described thereintransmits a spread spectrum signal comprised exclusively of a spreadingsequence, without any associated beacon data. The spreading sequence istransmitted at very low power to avoid detection and/or interception ofthe beacon signal by adversaries. However, the low power of the beaconsignal means that, in order to be received by neighboring nodes,substantial amounts of processing gain is needed. This processing gainis achieved using “relatively long” spreading sequences. The largeamounts of processing gain are advantageous, but necessarily limit theamount of data that can be transmitted. This is due to the fact that thedata rate must be much lower than chipping rate that is associated withthe spreading sequence. Accordingly, there remains a need fordiscovering neighbor nodes in ad-hoc wireless networks using beaconsignals that have a low probability of detection/interception, but whichalso have the ability to communicate sufficient amounts of network datato immediately initiate communications. In this regard, detectability isfurther reduced by increasing the probability that any given neighbordiscovery message will be properly received by an intended receiver,limiting the number of transmissions required to initiatecommunications.

Chaotic systems can generally be thought of as systems which varyunpredictably unless all of its properties are known. When measured orobserved, chaotic systems do not reveal any discernible regularity ororder. Chaotic systems are distinguished by a sensitive dependence on aset of initial conditions and by having an evolution through time andspace that appears to be quite random. However, despite its “random”appearance, chaos is a deterministic evolution.

Practically speaking, chaotic signals are extracted from chaotic systemsand have random-like, non-periodic properties that are generateddeterministically and are distinguishable from pseudo-random signalsgenerated using conventional PRNG devices. In general, a chaoticsequence is one in which the sequence is empirically indistinguishablefrom true randomness absent some knowledge regarding the algorithm whichis generating the chaos.

Some have proposed the use of multiple pseudo-random number generatorsto generate a digital chaotic-like sequence. However, such systems onlyproduce more complex pseudo-random number sequences that possess allpseudo-random artifacts and no chaotic properties. While certainpolynomials can generate chaotic behavior, it is commonly held thatarithmetic required to generate sufficiently large chaotic numbersequences requires an impractical implementation due to the precisionrequired.

Communications systems utilizing chaotic sequences offer promise forbeing the basis of a next generation of low probability of intercept(LPI) waveforms, low probability of detection (LPD) waveforms, andsecure waveforms. While many such communications systems have beendeveloped for generating chaotically modulated waveforms, suchcommunications systems suffer from low throughput. The term “throughput”as used herein refers to the amount of data transmitted over a data linkduring a specific amount of time. This throughput limitation stems fromthe fact that a chaotic signal is produced by means of a chaotic analogcircuit subject to drift.

The throughput limitation with chaos based communication systems can betraced to the way in which chaos generators have been implemented. Chaosgenerators have been conventionally constructed using analog chaoticcircuits. The reason for reliance on analog circuits for this task hasbeen the widely held conventional belief that efficient digitalgeneration of chaos is impossible. Notwithstanding the apparentnecessity of using analog type chaos generators, that approach has notbeen without problems. For example, analog chaos generator circuits areknown to drift over time. The term “drift” as used herein refers to aslow long term variation in one or more parameters of a circuit. Theproblem with such analog circuits is that the inherent drift forces therequirement that state information must be constantly transferred over acommunication channel to keep a transmitter and receiver adequatelysynchronized.

The transmitter and receiver in coherent chaos based communicationsystems are synchronized by periodically exchanging state informationover a data link. Such a synchronization process offers diminishingreturn because state information must be exchanged more often betweenthe transmitter and the receiver to obtain a high data rate. This highdata rate results in a faster relative drift. In effect, stateinformation must be exchanged at an increased rate between thetransmitter and receiver to counteract the faster relative drift.Although some analog chaotic communications systems employ a relativelyefficient synchronization process, these chaotic communications systemsstill suffer from low throughput.

The alternative to date has been to implement non-coherent chaoticwaveforms. However, non-coherent waveform based communication systemssuffer from reduced throughput and error rate performance. In thiscontext, the phrase “non-coherent waveform” means that the receiver isnot required to reproduce any synchronized copy of the chaotic signalsthat have been generated in the transmitter. Further, many non-coherentchaotic waveforms embed additional information in the signal that may beexploited by an unintended receiver to gain partial information of thetransmission. The phrase “communications using a coherent waveform”means that the receiver is required to reproduce a synchronized copy ofthe chaotic signals that have been generated in the transmitter.

SUMMARY OF THE INVENTION

The invention concerns a method for identifying neighbor nodes in anad-hoc wireless network including a plurality of nodes. The methodinvolves generating a beacon signal at a first node of the network foralerting other nodes in the network of the presence of the first node. Adigitally generated first spreading sequence is also generated at thefirst node. Thereafter, the beacon signal is modulated with the firstspreading sequence to produce a spread spectrum signal which is thentransmitted. The spreading sequence is selected to be a chaoticsequence.

According to one aspect of the invention, the beacon signal is modulatedto include beacon data, exclusive of the spreading sequence, identifyingone or more communication protocol parameters associated with the ad-hocnetwork. For example, the communication protocol parameters can includedata transmission rate, transmission frequency, receive frequency,transmission time and timing, quality of service parameter, bit errorrate parameter, bandwidth, a position of a node, a node velocity, and anode acceleration.

The spread spectrum signal is received at one or more second nodes inthe network which coherently demodulate the spread spectrum signal usinga second spreading sequence. The second spreading sequence is digitallygenerated at the second node and is advantageously used to recover theoriginal beacon signal. The beacon signal is used at the second node toidentify the first node as a neighbor node. Thereafter, a responsemessage is transmitted from the second node to the first node inresponse to the beacon signal. According to one aspect of the invention,the beacon signal is transmitted from the first node using anomni-directional antenna and the response message is transmitted fromthe second node to the first node using a directional antenna. Followinga neighbor discovery process, the method can continue with transmittingof network data between the first and the second node exclusive of usingthe first or second spreading sequence for modulating the network data.

In some embodiments of the invention, the step of generating a digitallygenerated chaotic spreading sequence includes the step of selecting aplurality of polynomial equations, and using residue number system (RNS)arithmetic operations to respectively determine a plurality of solutionsfor the plurality of polynomial equations. This step also includesiteratively computing the plurality of solutions expressed as RNSresidue values. The step of generating the digitally generated chaoticspreading sequence also includes determining a series of digits in aweighted number system based on the RNS residue values.

The invention also includes an ad-hoc network including a plurality ofnodes which is configured for carrying out the methods described herein.At least a first node is provided that includes a processor configuredto generate a beacon signal for alerting other nodes in the network ofthe presence of the first node. The first node also includes a firstspreading sequence generator for digitally generating a chaotic firstspreading sequence, and a first modulator configured for modulating thebeacon signal with the first digital spreading sequence to produce aspread spectrum signal.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments will be described with reference to the following drawingfigures, in which like numerals represent like items throughout thefigures, and in which:

FIG. 1 is a block diagram of a coherent chaotic spread-spectrumcommunication system that is useful for understanding the invention.

FIG. 2 is a block diagram of the transmitter shown in FIG. 1 that isuseful for understanding the invention.

FIG. 3A is a block diagram of an embodiment of the receiver shown inFIG. 1 that is useful for understanding the invention.

FIG. 3B is a block diagram of another embodiment of the receiver shownin FIG. 1 that is useful for understanding the invention.

FIG. 4 is a conceptual diagram of the digital chaos generators of FIGS.2-3 that is useful for understanding the invention.

FIG. 5 is a flow diagram of a method for generating a discrete chaoticsequence that is useful for understanding the invention.

FIG. 6 is a block diagram of the chaos generator of FIG. 2 that isuseful for understanding the invention.

FIG. 7 is drawing that is useful for understanding the concept ofneighbor discovery in an ad-hoc wireless network.

FIG. 8 is a block diagram of an exemplary node of an ad-hoc network thatis useful for understanding the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The invention will now be described more fully hereinafter withreference to accompanying drawings, in which illustrative embodiments ofthe invention are shown. This invention, may however, be embodied inmany different forms and should not be construed as limited to theembodiments set forth herein. For example, the present invention can beembodied as a method, a data processing system or a computer programproduct. Accordingly, the present invention can take the form as anentirely hardware embodiment, an entirely software embodiment or ahardware/software embodiment.

In an ad-hoc wireless network, individual nodes comprising the networkmust be able to locate and identify neighboring nodes. In conventionalwireless ad-hoc networks, this process of identifying neighbor nodes isaccomplished by using beacon signals. The beacon signals are typicallybroadcast at pre-determined timing intervals and at relatively highpower to ensure that neighbor nodes are adequately identified. Whilethis system works well, the high power and repetitive nature of suchbeacon signals makes them prone to being exploited. Some have tried tosolve this problem by simply transmitting a direct sequence spreadspectrum signal at very low power, absent of the communication protocoldata that is normally included in a beacon signal. The very low power,direct sequence spread spectrum transmissions offer low probability ofintercept and detection. However, such signals suffer from an importantlimitation, which is a very low data rate. Consequently, it is difficultto include any significant amount of network protocol data in the beaconsignal.

In contrast, the present invention uses a digitally generated chaoticspreading sequence to produce a spread spectrum transmission containingthe neighbor discovery data, which may include network initializationparameters like timeslots, transmission frequencies, networkcharacteristics, or routing tables. The digitally generated chaoticspreading sequence has the advantage of providing low probability ofintercept and detection, while also permitting relatively high datarates to be maintained. This is accomplished because spread spectrumsignals produced using digitally generated chaos as a spreading sequenceare more difficult to detect as compared to conventional direct sequencespreading codes. Chaotic sequence based waveforms do not have thecyclical features common in conventional direct sequence spreadwaveforms. Accordingly, higher power beacon transmissions can beprovided without sacrificing data rate or increasing exploitability.Consequently, higher data rates can be used in conjunction with thespread spectrum beacon signal without sacrificing the desirable featuresof low probability of intercept and low probability of detection.

Prior to describing in detail the way in which digitally generatedchaotic sequences can be used advantageously in ad-hoc networks, it ishelpful to understand more generally how digitally generated chaoticsequences can be used to implement spread spectrum communicationsystems. Accordingly, such a system shall be hereinafter described.Based on the discussion below, it will be appreciated by those skilledin the art that the techniques described herein can be used tocommunicate beacon signals in an ad-hoc network.

Spread Spectrum Communications Transceivers Using Chaotic Sequence

A digital chaos based spread spectrum communications system will now bedescribed with respect to FIG. 1 through FIG. 3B. The communicationsystem disclosed herein utilizes a coherent chaotic sequence spreadspectrum (CCSSS) method. Prior to being transmitted, data symbols arecombined with a higher rate chaotic sequence that spreads the spectrumof the data according to a spreading ratio. The resulting signalresembles a truly random signal, but this randomness can be removed atthe receiving end to recover the original data. In particular, the datais recovered by despreading the received signal using the same chaoticsequence which is generated at a receiver. The CCSSS system in relationto FIGS. 1 through 3B channel encodes a baseband carrier with PSKsymbols. The channel encoding is one of two operations commonly known asmodulation. The other operation commonly known as modulation is mixingtimes a local oscillator or other sequence which results in frequencytranslation and is also used herein.

The CCSSS system also modulates the phase modulated carrier in a chaoticmanner utilizing a string of discrete time chaotic samples. The discretetime chaotic samples shall hereinafter be referred to as “chips”. Aswill be appreciated by those familiar with direct sequence spreadspectrum (DSSS) systems, each chip will generally have a much shortersample time interval than the duration of each of the informationsymbols. Thus it will be understood that the carrier is modulated usingthe chaotic sequence chips. Moreover, it will be understood that thechip rate associated with the chaotic sequence is much higher than thesymbol rate. It should also be understood that the chaotic sequence ofchips which are utilized for generating the transmitted signal is knowna priori by the receiver. Consequently, the same chaotic sequence can beused at the receiver to reconstruct the non-spread carrier or remove theeffect of spreading at the receiver.

System Overview

Referring now to FIG. 1, there is provided a coherent chaoticspread-spectrum communication system 100 that is useful forunderstanding the present invention. The coherent chaoticspread-spectrum communication system 100 is comprised of a transmitter102 and a receiver 104. The transmitter 102 is configured to generate anamplitude-and-time-discrete baseband signal and to spread theamplitude-and-time-discrete baseband signal over a wide intermediatefrequency band. This spreading consists of multiplying theamplitude-and-time-discrete baseband signal by a digital chaoticsequence. The product of this arithmetic operation is hereinafterreferred to as a digital chaotic signal. In this regard, it should beunderstood that the transmitter 102 is also configured to process thedigital chaotic signal to place the same in a proper analog formsuitable for transmission over a communications link. The transmitter102 is further configured to communicate analog chaotic signals to thereceiver 104 via a communications link. The transmitter 102 will bedescribed in greater detail below in relation to FIG. 2.

The receiver 104 is configured to receive transmitted analog chaoticsignals from the transmitter 102. The receiver 104 is also configured todown convert, digitize, and de-spread a transmitted analog chaoticsignal by correlating it with a replica of the chaotic sequencegenerated at the transmitter 102. The chaotic sequence is also timesynchronized to the transmitted analog chaotic signal: i.e., a samplingrate of the chaotic sequence is the same as a sampling rate of thetransmitted analog chaotic signal and is synchronized with a clock (notshown) of the transmitter 102. The output of the arithmetic operationthat de-spreads the received signal is hereinafter referred to as ade-spread signal. In this regard, it should be understood that thereceiver 104 is further configured to process a de-spread signal forobtaining data contained therein. The receiver 104 is configured toconvert the data into useful payload information (such as beacon data)that can be used to identify the presence of neighbor nodes. Thereceiver 104 is described in greater detail below in relation to FIGS.3A and 3B.

Transmitter Detail

Referring now to FIG. 2, there is provided a bock diagram of thetransmitter 102 shown in FIG. 1 that is useful for understanding theinvention. It should be noted that the embodiment of FIG. 2 assumesthat: (1) a low order phase shift keying (PSK) data modulation is used;(2) no pulse shaping is applied to data symbols; (3) modulated datasymbols are generated in quadrature form; and (4) chaotic spectralspreading is performed at an intermediate frequency (IF).

Referring again to FIG. 2, the transmitter 102 is comprised of a datasource 202. The transmitter 102 is also comprised of a source encoder204, a symbol formatter 206, an acquisition data generator 208, atransmitter controller 210, a multiplexer 214, a channel encoder 216, aprecision real time reference 212, and a digital complex multiplier 224.The transmitter 102 is further comprised of a chaos generator 218, areal uniform statistics to quadrature Gaussian statistics mapper device(RUQG) 220, and a sample rate matching filter (SRMF) 222. Thetransmitter 102 is further comprised of an interpolator 226, a digitallocal oscillator (LO) 230, a real part of a complex multiplier 228, adigital-to-analog converter (DAC) 232, an anti-image filter 234, anintermediate frequency (IF) to radio frequency (RF) conversion device236, and an antenna element 238. Each of the above listed components202-216, 220-238 are well known to persons skilled in the art. Thus,these components will not be described in great detail herein. However,a brief discussion of the transmitter 102 architecture is provided toassist a reader in understanding the present invention.

Referring again to FIG. 2, the data source 202 is configured to receivebits of data from an external data source (not shown) as bits of data.In this regard, it should be appreciated that the data source 202 is aninterface configured for receiving an input signal containing data froman external device (not shown). The data source 202 is furtherconfigured to supply bits of data to the source encoder 204 at aparticular data transfer rate. The source encoder 204 can be configuredto encode the data received from the external device (not shown) using aforward error correction coding scheme. The bits of data received at orgenerated by the source encoder 204 represent any type of informationthat may be of interest to a user. For purposes of the presentinvention, the data include beacon information used to identify theexistence of neighbor nodes. However, it will be appreciated that theinvention is not limited in this regards. The source encoder 204 isfurther configured to supply bits of data to the symbol formatter 206 ata particular data transfer rate.

The symbol formatter 206 is configured to process bits of data forforming channel encoded symbols. In a preferred embodiment, the sourceencoded symbols are phase shift keyed (PSK) encoded. If it is desired touse a non-coherent form of PSK with the coherent chaos spread spectrumsystem, then the symbol formatter 204 can also be configured todifferentially encode formed PSK symbols. Differential encoding is wellknown to persons skilled in the art and therefore will not be describedin great detail herein. The symbol formatter 206 can be furtherconfigured to communicate non-differentially encoded PSK symbols and/ordifferentially encoded PSK symbols to the multiplexer 214. Still, theinvention is not limited in this regard.

According to an embodiment of the invention, the symbol formatter 206 isfunctionally similar to a serial in/parallel out shift register wherethe number of parallel bits out is equal to log base two (log₂) of theorder of the channel encoder 216. In this regard, the symbol formatter206 is selected for use with a quadrature phase shift keying (QPSK)modulator. As such, the symbol formatter 206 is configured to perform aQPSK formatting function for grouping two (2) bits of data together toform a QPSK symbol (i.e., a single two bit parallel word). Thereafter,the symbol formatter 206 communicates the encoded QPSK symbol to themultiplexer 214. Still, the invention is not limited in this regard.

According to another embodiment of the invention, the symbol formatter206 is functionally similar to a serial in/parallel out shift registerwhere the number of parallel bits out is equal to log base two (log₂) ofthe order of the channel encoder 216. In this regard, the symbolformatter 206 is selected for use with a binary phase shift keying(BPSK) modulator. As such, the symbol formatter 206 is configured to mapone bit of data to a BPSK symbol. Thereafter, the symbol formatter 206communicates the BPSK symbol to the multiplexer 214. Still, theinvention is not limited in this regard.

According to another embodiment of the invention, the symbol formatter206 is selected for use with a sixteen quadrature amplitude modulation(16 QAM) modulator. As such, the symbol formatter 206 is configured tomap four (4) bits to a 16 QAM symbol. Thereafter, the symbol formatter206 communicates the 16 QAM symbol to the multiplexer 214. Still, theinvention is not limited in this regard. For example, and withoutlimitation, an embodiment of the invention can also utilize pulseamplitude modulation.

According to another embodiment of the invention, the symbol formatter206 is selected for use with a binary amplitude shift keying (ASK)modulator. As such, the symbol formatter 206 is configured to map onebit of data to a ASK symbol. Thereafter, the symbol formatter 206communicates the ASK symbol to the multiplexer 214. Still, the inventionis not limited in this regard.

The transmitter 102 also includes an acquisition data generator 208capable of generating a “known data preamble” that can be used to enableinitial synchronization of a chaotic sequence generated in thetransmitter 102 and the receiver 104. The duration of this “known datapreamble” is determined by an amount required by the receiver 104 tosynchronize with the transmitter 102 under known worst case channelconditions. In some embodiments of the invention, the “known datapreamble” is a repetition of the same known symbol. In other embodimentsof the invention, the “known data preamble” is a series of knownsymbols. The acquisition data generator 208 can be further configured tocommunicate the “known data preamble” to the multiplexer 214.

Referring again to FIG. 2, the multiplexer 214 is configured to receivethe binary word to be modulated by the channel encoder from the symbolformatter 206. The multiplexer 214 is also configured to receive a“known data preamble” from the acquisition data generator 208. Themultiplexer 214 is coupled to the transmitter controller 210. Thetransmitter controller 210 is configured to control the multiplexer 214so that the multiplexer 214 routes the “known data preamble” to thechannel encoder 216 at the time of a new transmission.

According to an alternative embodiment of the invention, the “known datapreamble” is stored in a modulated form. In such a scenario, thearchitecture of FIG. 2 is modified such that the multiplexer 214 existsafter the channel encoder 216. Still, the invention is not limited inthis regard.

According to another embodiment of the invention, the “known datapreamble” may be injected at known intervals to aid in periodicresynchronization of the chaotic sequence generated in the transmitter102 and the receiver 104. This would typically be the case for animplementation meant to operate in harsh channel conditions. Still, theinvention is not limited in this regard.

Referring again to FIG. 2, the multiplexer 214 is configured to selectthe data symbols to be routed to the channel encoder 216 after apreamble period has expired. The multiplexer 214 is also configured tocommunicate the data symbols to the channel encoder 216. In this regard,it should be appreciated that a communication of the data symbols to thechannel encoder 216 is delayed by a time defined by the length of the“known data preamble.” As should be appreciated, this delay allows allof a “known data preamble” to be fully communicated to the channelencoder 216 prior to communication of the data symbols.

Referring again to FIG. 2, the channel encoder 216 is configured toperform actions for representing the “known data preamble” and the datasymbols in the form of a modulated amplitude-and-time-discrete digitalsignal. The modulated amplitude-and-time-discrete digital signal isdefined by digital words which represent intermediate frequency (IF)modulated symbols comprised of bits of data having a one (1) value or azero (0) value. Methods for representing digital symbols by anamplitude-and-time-discrete digital signal are well known to personsskilled in the art. Thus, such methods will not be described in greatdetail herein. However, it should be appreciated that the channelencoder 216 can employ any such method. For example, the channel encoder216 can be selected as a digital baseband modulator employing quadraturephase shift keying (QPSK). As will be appreciated by those skilled inthe art, the output of the QPSK modulator will include an in-phase (“I”)data and quadrature phase (“Q”) data. The I and Q data will bethereafter communicated to the digital complex multiplier 224.

According to an embodiment of the invention, the transmitter 102 isfurther comprised of a sample rate matching device (not shown) betweenthe channel encoder 216 and the digital complex multiplier 224. Thesample rate matching device (not shown) is provided for resampling theamplitude-and-time-discrete digital signal. As should be appreciated,the sample rate matching device (not shown) performs a sample rateincrease on the amplitude-and-time-discrete digital signal so that asample rate of the amplitude-and-time-discrete digital signal is thesame as a digital chaotic sequence communicated to the digital complexmultiplier 224. Still, the invention is not limited in this regard.

Referring again to FIG. 2, the digital complex multiplier 224 performs acomplex multiplication in the digital domain. In the digital complexmultiplier 224, the amplitude-and-time-discrete digital signal from thechannel encoder 216 is multiplied by a digital representation of achaotic sequence. The chaotic sequence is generated in the chaosgenerator 218. The rate at which the digital chaotic sequence isgenerated is an integer multiple of a data symbol rate. The greater theratio between the data symbol period and the sample period of thedigital chaotic sequence, the higher a spreading ratio. The chaosgenerator 218 communicates the chaotic sequence to a sequencestatistical conversion RUQG 220. The RUQG 220 is configured tostatistically transform a digital chaotic sequence into a transformeddigital chaotic sequence with chosen statistical properties. Thetransformed digital chaotic sequence can have a characteristic formincluding combinations of real, complex, or quadrature, being ofdifferent word widths, and having different statistical distributions.For example, the RUQG 220 may take in two (2) uniformly distributed realinputs from the chaos generator 218 and convert those via acomplex-valued bivariate Gaussian transformation to a quadrature outputhaving statistical characteristics of additive white Gaussian noise.Such conversions are well understood by those skilled in the art, andtherefore will not be described in great detail herein. However, itshould be understood that such techniques may use nonlinear processors,look-up tables, iterative processing (CORDIC functions), or othersimilar mathematical processes. The RUQG 220 is further configured tocommunicate transformed chaotic sequences to the SRMF 222.

The statistically transformed output of the digital chaotic sequence hasa multi-bit resolution consistent with a resolution of the DAC 232. TheRUQG 220 communicates the statistically transformed output of thedigital chaotic sequence to the SRMF 222. For example, the RUQG 220communicates an in-phase (“I”) data and quadrature phase (“Q”) data tothe SRMF 222 when the channel encoder 216 is configured to yield acomplex output representation. Still, the invention is not limited inthis regard.

If a chaos sample rate of the transformed chaotic sequence is differentthan a sample rate of the amplitude-and-time-discrete digital signal,then the two rates must be matched. The chaotic sequence can thereforebe resampled in the SRMF 222. For example, SRMF 222 can be comprised ofa real sample rate matching filter to resample each of the in-phase andquadrature-phase processing paths of the chaotic sequence. As should beappreciated, the SRMF 222 performs a sample rate change on thetransformed digital chaotic sequence so that a sample rate of thetransformed digital chaotic sequence is the same as anamplitude-and-time-discrete digital signal communicated to the digitalcomplex multiplier 224 from the channel encoder 216. The SRMF 222 isalso configured to communicate a resampled, transformed digital chaoticsequence to the digital complex multiplier 224.

According to an embodiment of the invention, the RUQG 220 statisticallytransforms a digital chaotic sequence into a quadrature Gaussian form ofthe digital chaotic sequence. This statistical transformation isachieved via a nonlinear processor that combines lookup tables andembedded computational logic to implement the conversion of two (2)independent uniformly distributed random variables into a quadraturepair of Gaussian distributed variables. One such structure for thisconversion is as shown in the mathematical expressions (1) and (2),which is commonly known as the Box-Muller transformation.G ₁=√{square root over (−2 log(u ₁))}·cos(2πu ₂)  (1)G ₂=√{square root over (−2 log(u ₁))}·sin(2πu ₂)  (2)where {u1, u2} are uniformly distributed independent input randomvariables and {G₁, G₂} are Gaussian distributed output random variables.In such a scenario, the SRMF 222 is comprised of one sample ratematching filter to resample an in-phase (“I”) data sequence and a secondsample rate matching filter to resample a quadrature-phase (“Q”) datasequence. The SRMF 222 is configured to communicate a resampled,transformed digital chaotic sequence to the digital complex multiplier224. More particularly, the SRMF 222 communicates an in-phase (“I”) dataand quadrature phase (“Q”) data to the digital complex multiplier 224.Still, the invention is not limited in this regard.

According to another embodiment of the invention, theamplitude-and-time-discrete digital signal and the digital chaoticsequence are generated as zero intermediate frequency (IF) signals.Also, pulse shaping is not employed. In such a scenario, the sample ratematching device (not shown) between the channel encoder 216 and thedigital complex multiplier 224 is not required. Still, the invention isnot limited in this regard.

The digital complex multiplier 224 performs a complex multiplication onthe digital chaotic sequence output from the SRMF 222 and theamplitude-and-time-discrete digital signal output from the channelencoder 216. The resulting output is a digital representation of acoherent chaotic sequence spread spectrum modulated IF signal in whichthe digital data from the channel encoder 216 has been spread over awide frequency bandwidth in accordance with a chaotic sequence generatedby the chaos generator 218.

The digital complex multiplier 224 is configured to combine a digitalchaotic sequence with an amplitude-and-time-discrete digital signalusing an arithmetic operation. The arithmetic operation is selected as acomplex-valued digital multiplication operation. The complex-valueddigital multiplication operation includes multiplying theamplitude-and-time-discrete digital signal by the digital chaoticsequence to obtain a digital chaotic output signal. The digital complexmultiplier 224 is also configured to communicate digital chaotic outputsignals to the interpolator 226.

The interpolator 226, real part of complex multiplier 228 and quadraturedigital local oscillator 230 operate in tandem to form an intermediatefrequency (IF) translator which frequency modulates a quadrature firstintermediate frequency (IF) signal received from the complex multiplierto a second real intermediate frequency (IF) signal. Such digitalintermediate frequency (IF) translators are known to those skilled inthe art and shall not be discussed in detail here.

The interpolator 226 accepts an input from the complex multiplier 224.In a preferred embodiment the modulated symbols are in quadrature formand the interpolator is implemented as two real interpolators. Still,the invention is not limited in this regard.

The interpolator 226 raises the sample rate of theamplitude-and-time-discrete digital signal received from the complexmultiplier 224 to a rate compatible with the bandwidth and centerfrequency of the second IF. The digital local oscillator 230 generates acomplex quadrature amplitude-and-time-discrete digital sinusoid at afrequency which shall translate the first intermediate frequency (IF) toa desired second intermediate frequency (IF). The digital localoscillator 230 is also configured to pass its output to the real part ofcomplex multiplier 228.

The real part of complex multiplier 228 is configured to accept as itsinputs the quadrature output of the interpolator 228 and the quadratureoutput of the digital local oscillator 230. The real part of a complexmultiplication is passed so that the real part of complex multiplier 228implements only the real output portion of a complex multiplication. Thereal part of complex multiplier 228 is configured to pass its output tothe DAC 232. Still, the invention is not limited in this regard.

According to an embodiment of the invention, the digital chaoticsequence and the amplitude-and-time-discrete digital signal are zerointermediate frequency (IF) signals. The digital chaotic sequence isused to amplitude modulate the “known data preamble” and the datasymbols via an efficient instantiation of a complex multiplier. Theresult of this amplitude modulation process is a zero IF signal. Still,the invention is not limited in this regard.

Referring again to FIG. 2, the IF translator and specifically the realpart of the complex multiplier 228 are configured to communicate asampled digital chaotic output signal (i.e., a digital chaotic outputsignal having an increased sampling rate and non-zero intermediatefrequency) to the DAC 232. The DAC 232 is configured to convert asampled digital chaotic output signal to an analog signal. The DAC 232is also configured to communicate an analog signal to the anti-imagefilter 234.

In some applications, it can be desirable to change a sampling rate atthe output of the digital complex multiplier 224 only, for example whenusing an interpolating DAC. An IF translator consisting of aninterpolator 226 only can be provided for this purpose.

According to an embodiment of the invention, the digital complexmultiplier 224 multiplies I and Q data of an amplitude-and-time-discretedigital signal by I and Q data of digital chaotic sequence to obtain adigital chaotic output signal. The digital chaotic output signal is aquadrature, zero IF signal. The digital complex multiplier 224communicates the quadrature, zero IF signal to the IF translator. The IFtranslator is an interpolation filter 226 only. The interpolation filter226 is comprised of dual real interpolators which change the sample rateof the quadrature, zero IF signal to a predetermined rate, such asseventy (70) mega sample per second. The interpolation filter 226communicates the sampled, quadrature, zero IF signal to the DAC 232. TheDAC 232 is an interpolating DAC that increases the effective samplerate. According to an embodiment of the invention, the DAC 232interpolates the received zero IF signal to a two hundred eighty (280)mega sample per second sample rate. The DAC 232 also up converts a realoutput component by a factor of the interpolated sample frequency (twohundred eighty (280) mega sample per second) divided four (4) beforeconversion to an analog signal. The output of the DAC 232 is thus a realsignal centered at a seventy (70) mega hertz intermediate frequency witha first image centered at two hundred ten (210) mega hertz. Still, theinvention is not limited in this regard.

Referring again to FIG. 2, the anti-image filter 234 is configured toremove spectral images from the analog signal to form a smooth timedomain signal. The anti-image filter 234 is also configured tocommunicate a smooth time domain signal to a RF translator 236. The RFtranslator 236 is a wide bandwidth analog IF to RF up converter. The RFtranslator 236 is configured to center a smooth time domain signal at anRF for transmission thereby forming an RF signal. The RF translator 236is also configured to communicate the RF signal to the power amplifier(not shown). The power amplifier (not shown) is configured to amplify areceived RF signal. The power amplifier (not shown) is configured tocommunicate the amplified RF signal to the antenna element 238 forcommunication to a receiver 104 (described below in relation to FIG.3A).

It should be understood that the digital generation of the digitalchaotic sequence at the transmitter 102 and receiver 104 is kept closelycoordinated under the control of a precision real time reference 212clock. The higher the precision of the clock 212, the closer thesynchronization of the chaos generator 218 of the transmitter 102 andthe chaos generator (described below in relation to FIG. 3A) of thereceiver 104 shall be excluding the effects of processing delaydifferences and channel propagation times. The use of a precision realtime reference allows the states of the chaos generators to be easilycontrolled with precision.

Referring again to FIG. 2, the precision real time reference 212 is astable local oscillator locked to a precision real time reference, suchas a GPS clock receiver or a chip scale atomic clock (CSAC). Theprecision real time reference 212 is configured to supply a highfrequency clock to the clocked logic circuits 206 through 232 whilebeing locked to a lower frequency reference clock. The lower frequencyreference clock supplies a common reference and a common real time ofday reference to prevent a large drift between the states of the chaosgenerator 218 and the chaos generator (described below in relation toFIG. 3A) of the receiver 104 over an extended time interval.

A person skilled in the art will appreciate that the transmitter 102 isone architecture of a communications system transmitter. However, theinvention is not limited in this regard and any other transmitterarchitecture can be used without limitation. For example, thetransmitter 102 can include real first to second intermediate frequency(IF) translation instead of a quadrature first to second intermediatefrequency (IF) translation. As another example, other architectures mayemploy additional chaotic sequence generators to provide a switchedchaotic output or to control other aspects of the transmitter 102.

Receiver Detail

Referring now to FIG. 3A, there is provided a block diagram of thereceiver 104 of FIG. 1 that is useful for understanding the invention.It should be noted that in conventional analog based coherentcommunications systems analog chaos circuits are synchronized byperiodically exchanging state information. The exchange of stateinformation requires a substantial amount of additional bandwidth. Thisis what makes analog based coherent communications impracticable. Thereceiver 104 of FIG. 3A is designed to eliminate the drawbacks ofconventional analog based coherent communications systems. In thisregard it should be appreciated that the receiver 104 is comprised of adigital chaos generator. The receiver 104 includes a tracking loop forsynchronizing its digital chaos generator and the digital chaosgenerator 218 of the transmitter 102. Most significantly, the receiveris configured to synchronize two (2) strings of discrete time chaoticsamples (i.e., chaotic sequences) without using a constant or periodictransfer of state update information. A first string of discrete timechaotic samples is generated at the transmitter 102. A second string ofdiscrete time chaotic samples is generated at the receiver 104.

Referring again to FIG. 3A, the receiver 104 is comprised of an antennaelement 302, a low noise amplifier (LNA) 304, a zonal filter 306, an AGCamplifier 308, a radio frequency (RF) to intermediate frequency (IF)conversion device 310, an anti-alias filter 312, and ananalog-to-digital (A/D) converter 314. The receiver 104 is alsocomprised of real multipliers 316, 318, a loop control circuit 320, aquadrature digital local oscillator 322, a correlator 328, amultiplexers 346, 348, a channel encoded acquisition data generator(CEADG) 350, digital complex multipliers 324, 352, and a symbol timingrecovery circuit 326. The receiver 104 is further comprised of areceiver controller 338, a precision real time reference clock 336, ahard decision device 330, a symbol to bits (S/B) converter 332, and asource decoder 334. The receiver 104 is comprised of a chaos generator340, a real uniform statistic to quadrature Gaussian statistic mapper(RUQG) 342, and a re-sampling filter 344. Each of the above listedcomponents and circuits 302-318, 322-326, 330-338, 342-352 are wellknown to persons skilled in the art. Thus, these components and circuitswill not be described in great detail herein. However, a briefdiscussion of the receiver 104 architecture is provided to assist areader in understanding the present invention. It should be noted thatwhen the receiver 104 is in both acquisition and tracking modes(described below) the receiver 104 is utilizing a novelarchitecture/algorithm.

Referring again to FIG. 3A, the antenna element 302 is configured toreceive an analog input signal communicated from the transmitter 102over a communications link. The antenna element 302 is also configuredto communicate the analog input signal to the LNA 304. The LNA 304 isconfigured to amplify a received analog input signal while adding aslittle noise and distortion as possible. The LNA 304 is also configuredto communicate an amplified, analog input signal to the zonal filer 306.Zonal filters are analog filters with slow roll off characteristic butlow injection loss used to suppress large interfering signals outside ofbands of interest. Zonal filters are well known to persons skilled inthe art, and therefore will not be described in great detail herein. Itshould be appreciated that the zonal filter 306 is configured tocommunicate a filtered, analog input signal to the automatic gaincontrol (AGC) amplifier 308. An automatic gain control (AGC) amplifier308 is a controllable gain amplifier used to keep the magnitude of thereceived signal within normal bounds for the rest of the signalprocessing chain. Automatic gain control (AGC) amplifiers are well knownto persons skilled in the art, and therefore will not be described ingreat detail herein. It should be appreciated that the automatic gaincontrol (AGC) amplifier 308 is configured to communicate a gainadjusted, analog input signal to the RF to IF conversion device 310.

The RF to IF conversion device 310 is configured to mix the analog inputsignal to a preferred IF for conversion to a digital signal at the A/Dconverter 314. The RF to IF conversion device 310 is also configured tocommunicate a mixed analog input signal to the anti-alias filter 312.The anti-alias filter 312 is configured to restrict a bandwidth of amixed analog input signal. The anti-alias filter 312 is also configuredto communicate a filtered, analog input signal to the A/D converter 314.The A/D converter 314 is configured to convert a received analog inputsignal to a digital signal. The A/D converter 314 is also configured tocommunicate a digital input signal to a second IF translator which iscomprised of the real multipliers 316, 318, and the programmablequadrature digital local oscillator 332.

The multiplier 316 is configured to receive a digital word as input fromthe A/D converter 314 and a digital word from the in-phase component ofthe quadrature digital local oscillator 322. The multiplier 316multiplies the output of the A/D converter 314 by the in-phase componentof the quadrature digital local oscillator 322. The multiplier 316 isalso configured to communicate a digital output word. The multiplier 318is configured to receive a digital word as input from the A/D converter314 and a digital word from the quadrature-phase component of thequadrature digital local oscillator 322. The multiplier 318 multipliesthe output of the A/D converter 314 by the quadrature-phase component ofthe quadrature digital local oscillator 322. The multiplier 318 is alsoconfigured to communicate a digital output word.

The quadrature digital local oscillator 322 generates a complexquadrature amplitude-and-time-discrete digital sinusoid at a frequencywhich shall translate the first IF to baseband and remove detectedfrequency and phase offsets in the resulting quadrature baseband signal.The quadrature digital local oscillator accepts as its inputs a binaryphase control word and a binary frequency control word from the loopcontrol circuit 320. Quadrature digital local oscillators are known tothose skilled in the art, and therefore will not be described in detailherein.

The IF translator is configured to mix the digital input signal to apreferred IF for processing at the correlator 328 and the digitalcomplex multiplier 324. The IF translator is also configured tocommunicate a digital input signal to the correlator 328 and the digitalcomplex multiplier 324. As will be appreciated by those skilled in theart, the output of the IF translator can include an in-phase (“I”) dataand quadrature phase (“Q”) data. As such, the IF translator cancommunicate I and Q data to the correlator 328 and the digital complexmultiplier 324.

The digital complex multiplier 324 is configured to perform a complexmultiplication in the digital domain. In the complex-valued digitalmultiplier 324, the digital input signal from the IF translator ismultiplied by a digital representation of a chaotic sequence. Thechaotic sequence is generated in the chaos generator 340. The chaosgenerator 340 communicates the chaotic sequence to an RUQG 342. In thisregard, it should be appreciated that the chaos generator 340 is coupledto the receiver controller 338. The receiver controller 338 isconfigured to control the chaos generator 340 so that the chaosgenerator 340 generates a chaotic sequence with the correct initialstate when the receiver 104 is in an acquisition mode and a trackingmode.

The RUQG 342 is configured to statistically transform a digital chaoticsequence into a transformed digital chaotic sequence. The transformeddigital chaotic sequence can have a characteristic form includingcombinations of real, complex, or quadrature, being of different wordwidths, and having different statistical distributions. One suchstatistical transformation used in the preferred embodiment is abivariate Gaussian distribution that converts two (2) independentuniformly distributed random variables to a pair of quadrature Gaussiandistributed variables. The RUQG 342 is further configured to communicatetransformed chaotic sequences to the re-sampling filter 344.

According to the embodiment of the invention, the RUQG 342 statisticallytransforms a digital chaotic sequence into a quadrature Gaussian form ofthe digital chaotic sequence. The RUQG 342 communicates the quadratureGaussian form of the digital chaotic sequence to the re-sampling filter344. More particularly, the RUQG 342 communicates an in-phase (“I”) dataand quadrature phase (“Q”) data to the re-sampling filter 344. Still,the invention is not limited in this regard.

The re-sampling filter 344 is also configured to forward a transformedchaotic sequence to the digital complex multiplier 324. The re-samplingfilter 344 is configured as a sample rate change filter for making thechaos sample rate compatible with the received signal sample rate whenthe receiver 104 is in acquisition mode. The re-sampling filter 344 isalso configured to compensate for transmit and receive clock offsetswith less than a certain level of distortion when the receiver is in asteady state demodulation mode. In this regard, it should be appreciatedthat the re-sampling filter 344 is configured to convert a sampling rateof in-phase (“I”) and quadrature-phase (“Q”) data sequences from a firstsampling rate to a second sampling rate without changing the spectrum ofthe data contained in therein. The re-sampling filter 344 is furtherconfigured to communicate in-phase (“I”) and quadrature-phase (“Q”) datasequences to the digital complex multipliers 324, 352, and themultiplexers 346, 348.

It should be noted that if a sampled form of a chaotic sequence isthought of as discrete samples of a continuous band limited chaos thenthe re-sampling filter 344 is effectively tracking the discrete timesamples, computing a continuous representation of the chaotic sequence,and resampling the chaotic sequence at the discrete time points requiredto match the discrete time points sampled by the A/D converter 314. Ineffect, input values and output values of the re-sampling filter 344 arenot exactly the same because the values are samples of the same waveformtaken at slightly offset times. However, the values are samples of thesame waveform so the values have the same power spectral density.

Referring again to FIG. 3A, the CEADG 350 is configured to generate amodulated acquisition sequence. The CEADG 350 is also configured tocommunicate a modulated acquisition sequence to the digital complexmultiplier 352. The digital complex multiplier 352 is configured toperform a complex multiplication in the digital domain. This complexmultiplication includes multiplying a modulated acquisition sequencefrom the CEADG 350 by a digital representation of a chaotic sequence toyield a reference for a digital input signal. The digital complexmultiplier 352 is also configured to communicate reference signal to themultiplexers 346, 348. The multiplexer 346 is configured to route thequadrature-phase part of a reference signal to the correlator 328. Themultiplexer 348 is configured to route the in-phase part of a referencesignal to the correlator 328. In this regard, it should be appreciatedthat the multiplexers 346, 348 are coupled to the receiver controller338. The receiver controller 338 is configured to control themultiplexers 346, 348 in tandem so that the multiplexers 346, 348 routethe reference signal to the correlator 328 while the receiver 104 is inan acquisition mode (described below).

The correlator 328 is configured to correlate a chaotic sequence with adigital input signal. In this regard, it should be understood that, thesense of the real and imaginary components of the correlation isdirectly related to the values of the real and imaginary components ofthe symbols of a digital input signal. It should also be understoodthat, in a preferred embodiment, the sense of the real and imaginarycomponents of the correlation is directly related to the values of thereal and imaginary components of the PSK symbols of a digital inputsignal. Thus, when the correlator 328 is in a steady state demodulationmode the output of the correlator 328 is PSK symbol soft decisions. Inthis regard, it should be appreciated that soft information refers tosoft-values (which are represented by soft-decision bits) that compriseinformation about the bits contained in a sequence. In particular,soft-values are values that represent the probability that a particularbit in a sequence is either a one (1) or a zero (0). For example, asoft-value for a particular bit can indicate that a probability of a bitbeing a one (1) is p(1)=0.3. Conversely, the same bit can have aprobability of being a zero (0) which is p(0)=0.7.

The correlator 328 is also configured to communicate PSK soft decisionsto the hard decision device 330 for final symbol decision making. Thehard decision device 330 is configured to communicate symbol decisionsto the S/B converter 332. The S/B converter 332 is configured to convertsymbols to a binary form. The S/B converter 332 is configured tocommunicate a binary data sequence to the source decoder 334. The sourcedecoder 334 is configured to decode FEC applied at the transmitter andto pass the decoded bit stream to one or more external devices (notshown) utilizing the decoded data.

The correlator 328 is also configured to acquire initial timinginformation associated with a chaotic sequence, initial timingassociated with a data sequence and to track phase and frequency offsetinformation between the chaotic sequence and a digital input signal. Thecorrelator 328 is also configured to track input signal magnitudeinformation between the chaotic sequence and a digital input signal.Acquisition of initial timing information and tracking of input signalmagnitude, phase and frequency offset information are both standardfunctions in digital communication systems. As such, methods foracquiring initial timing information and tracking phase and frequencyoffset information are well known to persons skilled in the art, andtherefore will not be described in detail herein. However, it should beappreciated that any such method can be used without limitation.

Referring again to FIG. 3A, the correlator 328 is configured tocommunicate the magnitude and phase information as a function of time tothe loop control circuit 320. The loop control circuit 320 uses themagnitude and phase information to calculate the deviation of the inputsignal magnitude from a nominal range, and phase and frequency offsetinformation to synchronize a chaotic sequence with a digital inputsignal. The loop control circuit 320 is also configured to communicatethe phase and frequency offset information to the quadrature digitallocal oscillator 322 portion of the IF translator and gain deviationcompensation information to the automatic gain control (AGC) amplifier308. The loop control circuit 320 is further configured to communicate aretiming control signal to the re-sampling filter SRMD 344 and the chaosgenerator 340.

It should be understood that the digital generation of the digitalchaotic sequence at the transmitter 102 and receiver 104 is kept closelycoordinated under the control of a precision real time reference clock336. The higher the precision of the clock 336, the closer thesynchronization of the chaos generator 218 of the transmitter 102 andthe chaos generator 340 of the receiver 104 shall be excluding theeffects of processing delay differences and channel propagation times.It is the use of digital chaos generators 218, 340 that allow the statesof the chaos generators to be easily controlled with precision, thusallowing coherent communication.

Referring again to FIG. 3A, the precision real time reference clock 336is a stable local oscillator locked to a precision real time reference,such as a GPS clock receiver or a chip scale atomic clock (CSAC). Theprecision real time reference clock 336 is configured to supply a highfrequency clock to the clocked logic circuits 314, . . . , 352 whilebeing locked to a lower frequency reference clock. The lower frequencyreference clock supplies a common reference and a common real time ofday reference to prevent a large drift between the states of the chaosgenerator 218 and the chaos generator 340 of the receiver 104 over anextended time interval.

The operation of the receiver 104 will now be briefly described withregard to an acquisition mode and a steady state demodulation mode.

Acquisition Mode:

In acquisition mode, the re-sampling filter 344 performs a rational ratechange and forwards a transformed chaotic sequence to the digitalcomplex multiplier 352. The CEADG 350 generates a modulated acquisitionsequence and forwards the same to the digital complex multiplier 352.The digital complex multiplier 352 performs a complex multiplication inthe digital domain. In the digital complex multiplier 352, a modulatedacquisition sequence from the CEADG 350 is multiplied by a digitalrepresentation of a chaotic sequence to yield a reference for a digitalinput signal that was generated at the transmitter 102 to facilitateinitial acquisition. The chaotic sequence is generated in the chaosgenerator 340. The digital complex multiplier 352 communicates areference signal to the multiplexers 346, 348. The multiplexers 346, 348route the reference signal to the correlator 328. The correlator 328 istransitioned into a search mode. In this search mode, the correlator 328searches across an uncertainty window to locate a received signal stateso that the chaos generator 340 can be set with the time synchronizedstate vector.

Steady State Demodulation Mode:

In steady state demodulation mode, the correlator 328 tracks thecorrelation between the received modulated signal and the locallygenerated chaos close to the nominal correlation peak to generatemagnitude and phase information as a function of time. This informationis passed to the loop control circuit 320. The loop control circuit 320applies appropriate algorithmic processing to this information toextract phase offset, frequency offset, and magnitude compensationinformation. The correlator 328 also passes its output information,based on correlation times terminated by symbol boundaries, to the harddecision block 330. The hard decision block 330 compares the correlationinformation to pre-determined thresholds to make hard symbol decisions.The loop control circuit 320 monitors the output of the correlator 318.When the loop control circuit 320 detects fixed correlation phaseoffsets, the phase control of the quadrature digital local oscillator322 is modified to remove the phase offset. When the loop controlcircuit 320 detects phase offsets that change as a function of time, itadjusts the re-sampling filter 344 which acts as an incommensuratere-sampler when the receiver 104 is in steady state demodulation mode orthe frequency control of the quadrature digital local oscillator 322 ismodified to remove frequency or timing offsets. When the correlator's328 output indicates that the received digital input signal timing has“drifted” more than plus or minus a half (½) of a sample time relativeto a locally generated chaotic sequence. The loop control circuit 320:(1) adjusts a correlation window in an appropriate temporal direction byone sample time; (2) advances or retards a state of the local chaosgenerator 340 by one iteration state; and (3) adjusts the re-samplingfilter 344 to compensate for the time discontinuity. This loop controlcircuit 320 process keeps the chaos generator 218 of the transmitter 102and the chaos generator 340 of the receiver 104 synchronized to withinhalf (½) of a sample time.

If a more precise temporal synchronization is required to enhanceperformance, a resampling filter can be implemented as a member of theclass of polyphase fractional time delay filters. This class of filtersis well known to persons skilled in the art, and therefore will not bedescribed in great detail herein.

As described above, a number of chaotic samples are combined with aninformation symbol at the transmitter 102. Since the transmitter 102 andreceiver 104 timing are referenced to two (2) different precision realtime reference clock 212, 336 oscillators, symbol timing must berecovered at the receiver 104 to facilitate robust demodulation. Symboltiming recovery can include: (1) multiplying a received input signal bya complex conjugate of a locally generated chaotic sequence using thecomplex multiplier 324; (2) computing an N point running average of theproduct where N is a number of chaotic samples per symbol time; (3)storing the values, the maximum absolute values of the running averages,and the time of occurrence; and (4) statistically combining the valuesat the symbol timing recovery circuit 326 to recover symbol timing. Itshould be noted that symbol timing recover can also be accomplished viaan output of the correlator 328. However, additional correlatoroperations are needed in such a scenario. As should be appreciated,using a separate multiplier operation for this purpose adds additionalcapabilities to the receiver 104, such as the capability to correlateand post process over multiple correlation windows simultaneously tolocate the best statistical fit for symbol timing.

In this steady state demodulation mode, the symbol timing recoverycircuit 326 communicates a symbol onset timing to the correlator 328 forcontrolling an initiation of a symbol correlation. The correlator 328correlates a locally generated chaotic sequence with a received digitalinput signal during a symbol duration. In this regard, it should beunderstood that, the sense and magnitude of a real and imaginarycomponents of the correlation is directly related to the values of thereal and imaginary components of symbols of a digital input signal.Accordingly, the correlator 328 generates symbol soft decisions. Thecorrelator 328 communicates the symbol soft decisions to the harddecision device 330 for final symbol decision making. The hard decisiondevice 330 determines symbols using the symbol soft decisions.Thereafter, the hard decision device 330 communicates the symbols to theS/B converter 332. The S/B converter 332 converts the symbol decisionsto a binary form. The S/B converter 332 is configured to communicate abinary data sequence to the source decoder 334. The source decoder 334is configured to decide FEC applied at the transmitter 102 and pass thedecoded bit stream to one or more external devices (not shown) utilizingthe decoded data.

A person skilled in the art will appreciate that the receiver 104 is onearchitecture of a communications system receiver. However, the inventionis not limited in this regard and any other receiver architecture can beused without limitation. For example, another embodiment of a receiveris provided in FIG. 3B.

Referring now to FIG. 3B, there is provided a block diagram of anotherembodiment of a receiver that is useful for understanding the invention.As shown in FIG. 3B, the receiver 390 is comprised of an antenna element392, a low noise amplifier (LNA) 354, a zonal filter 356, intermediatefrequency (IF) translators 358, 364, an anti-alias filter 360, and ananalog-to-digital (A/D) converter 362. The receiver 390 is alsocomprised of a loop control circuit 366, a correlator 368, and a digitalcomplex multiplier 370. The receiver 390 is further comprised of areceiver controller 374, a precision real time reference 376, a harddecision device 372, a symbol to bits (S/B) converter 384, and a sourcedecoder 386. The receiver 390 is comprised of a residue number system(RNS) chaos generator 382 and a real uniform statistics to quadratureGaussian statistics mapper 378. Each of the above listed components354-386, 392 are similar to the respective components 302-306, 312, 314,320, 328-342, 352 of FIG. 3A. Thus, the description provided above inrelation to FIG. 3A is sufficient for understanding the receiver 390architecture shown in FIG. 3B.

Chaos Generators and Digital Chaotic Sequence Generation

Referring now to FIG. 4, there is provided a conceptual diagram of achaos generator 218, 340, 382 (described above in relation to FIGS.2-3B) that is useful for understanding the invention. As shown in FIG.4, generation of the chaotic sequence begins with N polynomial equationsf₀(x(nT)), . . . , f_(N-1)(x(nT)). The N polynomial equations f₀(x(nT)),. . . , f_(N-1)(x(nT)) can be selected as the same polynomial equationor as different polynomial equations. According to an aspect of theinvention, the N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT))are selected as irreducible polynomial equations having chaoticproperties in Galois field arithmetic. Such irreducible polynomialequations include, but are not limited to, irreducible cubic polynomialequations and irreducible quadratic polynomial equations. The phrase“irreducible polynomial equation” as used herein refers to a polynomialequation that cannot be expressed as a product of at least twonontrivial polynomial equations over the same Galois field (f). Forexample, the polynomial equation f(x(nT)) is irreducible if there doesnot exist two (2) non-constant polynomial equations g(x(nT)) andh(x(nT)) in x(nT) with rational coefficients such thatf(x(nT))=g(x(nT))·h(x(nT)).

As will be understood by a person skilled in the art, each of the Npolynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)) can be solvedindependently to obtain a respective solution. Each solution can beexpressed as a residue number system (RNS) residue value using RNSarithmetic operations, i.e. modulo operations. Modulo operations arewell known to persons skilled in the art. Thus, such operations will notbe described in great detail herein. However, it should be appreciatedthat a RNS residue representation for some weighted value “a” can bedefined by mathematical Equation (1).R={a modulo m₀, a modulo m₁, . . . , a modulo m_(N-1)}  (1)where R is a RNS residue N-tuple value representing a weighted value“a”. Further, R(nT) can be a representation of the RNS solution of apolynomial equation f(x(nT)) defined as R(nT)={f₀(x(nT)) modulo m₀,f₁(x(nT)) modulo m₁, . . . . , f_(N-1)(x(nT)) modulo m_(N-1)}. m₀, m₁, .. . , m_(N-1) respectively are the moduli for RNS arithmetic operationsapplicable to each polynomial equation f₀(x(nT)), . . . ,f_(N-1)(x(nT)).

From the foregoing, it will be appreciated that the RNS employed forsolving each of the polynomial equations f₀(x(nT)), . . . ,f_(N-1)(x(nT)) respectively has a selected modulus value m₀, m₁, . . . ,m_(N-1). The modulus value chosen for each RNS moduli is preferablyselected to be relatively prime numbers p₀, p₁, . . . , p_(N-1). Thephrase “relatively prime numbers” as used herein refers to a collectionof natural numbers having no common divisors except one (1).Consequently, each RNS arithmetic operation employed for expressing asolution as a RNS residue value uses a different prime number p₀, p₁, .. . , p_(N-1) as a moduli m₀, m₁, . . . , m_(N-1).

Those skilled in the art will appreciate that the RNS residue valuecalculated as a solution to each one of the polynomial equationsf₀(x(nT)), . . . , f_(N-1)(x(nT)) will vary depending on the choice ofprime numbers p₀, p₁, . . . , p_(N-1) selected as a moduli m₀, m₁, . . ., m_(N-1). Moreover, the range of values will depend on the choice ofrelatively prime numbers p₀, p₁, . . . , p_(N-1) selected as a modulim₀, m₁, . . . , m_(N-1). For example, if the prime number five hundredthree (503) is selected as modulus m₀, then an RNS solution for a firstpolynomial equation f₀(x(nT)) will have an integer value between zero(0) and five hundred two (502). Similarly, if the prime number fourhundred ninety-one (491) is selected as modulus m₁, then the RNSsolution for a second polynomial equation f₁(x(nT)) has an integer valuebetween zero (0) and four hundred ninety (490).

According to an embodiment of the invention, each of the N polynomialequations f₀(x(nT)), . . . , f_(N-1)(x(nT)) is selected as anirreducible cubic polynomial equation having chaotic properties inGalois field arithmetic. Each of the N polynomial equations f₀(x(nT)), .. . , f_(N-1)(x(nT)) can also be selected to be a constant or varyingfunction of time. The irreducible cubic polynomial equation is definedby a mathematical Equation (2).f(x(nT))=Q(k)x ³(nT)+R(k)x ²(nT)+S(k)x(nT)+C(k,L)  (2)where n is a sample time index value. k is a polynomial time indexvalue. L is a constant component time index value. T is a fixed constanthaving a value representing a time interval or increment. Q, R, and Sare coefficients that define the polynomial equation f(x(nT)). C is acoefficient of x(nT) raised to a zero power and is therefore a constantfor each polynomial characteristic. In a preferred embodiment, a valueof C is selected which empirically is determined to produce anirreducible form of the stated polynomial equation f(x(nT)) for aparticular prime modulus. For a given polynomial with fixed values forQ, R, and S more than one value of C can exist, each providing a uniqueiterative sequence. Still, the invention is not limited in this regard.

According to another embodiment of the invention, the N polynomialequations f₀(x(nT)) . . . , f_(N-1)(x(nT)) are identical exclusive of aconstant value C. For example, a first polynomial equation f₀(x(nT)) isselected as f₀(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C₀. A second polynomialequation f₁(x(nT)) is selected as f₁(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C₁. Athird polynomial equation f₂(x(nT)) is selected asf₂(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C₂, and so on. Each of the constantvalues C₀, C₁, . . . , C_(N-1) is selected to produce an irreducibleform in a residue ring of the stated polynomial equationf(x(nT))=3x³(nT)+3x²(nT)+x(nT)+C. In this regard, it should beappreciated that each of the constant values C₀, C₁, . . . , C_(N-1) isassociated with a particular modulus m₀, m₁, . . . , m_(N-1) value to beused for RNS arithmetic operations when solving the polynomial equationf(x(nT)). Such constant values C₀, C₁, . . . , C_(N-1) and associatedmodulus m₀, m₁, . . . , m_(N-1) values which produce an irreducible formof the stated polynomial equation f(x(nT)) are listed in the followingTable (1).

TABLE 1 Moduli values m₀, Sets of constant values C₀, m₁, . . . ,m_(N−1): C₁, . . . , C_(N−1): 3 {1, 2} 5 {1, 3} 11 {4, 9} 29 {16, 19} 47{26, 31} 59 {18, 34} 71 {10, 19, 20, 29} 83 {22, 26, 75, 79} 101 {27,38, 85, 96} 131 {26, 39, 77, 90} 137 {50, 117} 149 {17, 115, 136, 145}167 {16, 32, 116, 132} 173 {72, 139} 197 {13, 96, 127, 179} 233 {52, 77}251 {39, 100, 147, 243} 257 {110, 118} 269 {69, 80} 281 {95, 248} 293{37, 223} 311 {107, 169} 317 {15, 55} 347 {89, 219} 443 {135, 247, 294,406} 461 {240, 323} 467 {15, 244, 301, 425} 479 {233, 352} 491 {202,234} 503 {8, 271}Still, the invention is not limited in this regard.

The number of discrete magnitude states (dynamic range) that can begenerated with the system shown in FIG. 4 will depend on the quantity ofpolynomial equations N and the modulus values m₀, m₁, . . . , m_(N-1)values selected for the RNS number systems. In particular, this valuecan be calculated as the product M=m₀·m₁,·m₃·m₄· . . . ·m_(N-1).

Referring again to FIG. 4, it should be appreciated that each of the RNSsolutions Nos. 1 through N is expressed in a binary number systemrepresentation. As such, each of the RNS solutions Nos. 1 through N is abinary sequence of bits. Each bit of the sequence has a zero (0) valueor a one (1) value. Each binary sequence has a bit length selected inaccordance with a particular moduli.

According to an embodiment of the invention, each binary sequencerepresenting a residue value has a bit length (BL) defined by amathematical Equation (3).BL=Ceiling[Log 2(m)]  (3)where m is selected as one of moduli m₀, m₁, . . . , m_(N-1). Ceiling[u]refers to a next highest whole integer with respect to an argument u.

In order to better understand the foregoing concepts, an example isuseful. In this example, six (6) relatively prime moduli are used tosolve six (6) irreducible polynomial equations f₀(x(nT)), . . . ,f₅(x(nT)). A prime number p₀ associated with a first modulus m₀ isselected as five hundred three (503). A prime number p₁ associated witha second modulus m₁ is selected as four hundred ninety one (491). Aprime number p₂ associated with a third modulus m₂ is selected as fourhundred seventy-nine (479). A prime number p₃ associated with a fourthmodulus m₃ is selected as four hundred sixty-seven (467). A prime numberp₄ associated with a fifth modulus m₄ is selected as two hundredfifty-seven (257). A prime number p₅ associated with a sixth modulus m₅is selected as two hundred fifty-one (251). Possible solutions forf₀(x(nT)) are in the range of zero (0) and five hundred two (502) whichcan be represented in nine (9) binary digits. Possible solutions forf₁(x(nT)) are in the range of zero (0) and four hundred ninety (490)which can be represented in nine (9) binary digits. Possible solutionsfor f₂(x(nT)) are in the range of zero (0) and four hundred seventyeight (478) which can be represented in nine (9) binary digits. Possiblesolutions for f₃(x(nT)) are in the range of zero (0) and four hundredsixty six (466) which can be represented in nine (9) binary digits.Possible solutions for f₄(x(nT)) are in the range of zero (0) and twohundred fifty six (256) which can be represented in nine (9) binarydigits. Possible solutions for f₅(x(nT)) are in the range of zero (0)and two hundred fifty (250) which can be represented in eight (8) binarydigits. Arithmetic for calculating the recursive solutions forpolynomial equations f₀(x(nT)), . . . , f₄(x(nT)) requires nine (9) bitmodulo arithmetic operations. The arithmetic for calculating therecursive solutions for polynomial equation f₅(x(nT)) requires eight (8)bit modulo arithmetic operations. In aggregate, the recursive resultsf₀(x(nT)), . . . , f₅(x(nT)) represent values in the range from zero (0)to M-1. The value of M is calculated as follows:p₀·p₁·p₂·p₃·p₄·p₅=503·491·479·467·257·251=3,563,762,191,059,523. Thebinary number system representation of each RNS solution can be computedusing Ceiling[Log 2(3,563,762,191,059,523)]=Ceiling[51.66]=52 bits.Because each polynomial is irreducible, all 3,563,762,191,059,523possible values are computed resulting in a sequence repetition time ofevery M times T seconds, i.e, a sequence repetition times an interval oftime between exact replication of a sequence of generated values. Still,the invention is not limited in this regard.

Referring again to FIG. 4, the RNS solutions Nos. 1 through N are mappedto a weighted number system representation thereby forming a chaoticsequence output. The phrase “weighted number system” as used hereinrefers to a number system other than a residue number system. Suchweighted number systems include, but are not limited to, an integernumber system, a binary number system, an octal number system, and ahexadecimal number system.

According to an aspect of the invention, the RNS solutions Nos. 1through N are mapped to a weighted number system representation bydetermining a series of digits in the weighted number system based onthe RNS solutions Nos. 1 through N. The term “digit” as used hereinrefers to a symbol of a combination of symbols to represent a number.For example, a digit can be a particular bit of a binary sequence.According to another aspect of the invention, the RNS solutions Nos. 1through N are mapped to a weighted number system representation byidentifying a number in the weighted number system that is defined bythe RNS solutions Nos. 1 through N. According to yet another aspect ofthe invention, the RNS solutions Nos. 1 through N are mapped to aweighted number system representation by identifying a truncated portionof a number in the weighted number system that is defined by the RNSsolutions Nos. 1 through N. The truncated portion can include anyserially arranged set of digits of the number in the weighted numbersystem. The truncated portion can also be exclusive of a mostsignificant digit of the number in the weighted number system. Thephrase “truncated portion” as used herein refers to a chaotic sequencewith one or more digits removed from its beginning and/or ending. Thephrase “truncated portion” also refers to a segment including a definednumber of digits extracted from a chaotic sequence. The phrase“truncated portion” also refers to a result of a partial mapping of theRNS solutions Nos. 1 through N to a weighted number systemrepresentation.

According to an embodiment of the invention, a mixed-radix conversionmethod is used for mapping RNS solutions Nos. 1 through N to a weightednumber system representation. “The mixed-radix conversion procedure tobe described here can be implemented in” [modulo moduli only and notmodulo the product of moduli.] See Residue Arithmetic and ItsApplications To Computer Technology, written by Nicholas S. Szabo &Richard I. Tanaka, McGraw-Hill Book Co., New York, 1967. To beconsistent with said reference, the following discussion of mixed radixconversion utilizes one (1) based variable indexing instead of zero (0)based indexing used elsewhere herein. In a mixed-radix number system, “anumber x may be expressed in a mixed-radix form:

$x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; R_{i}}} + \ldots + {a_{3}R_{1}R_{2}} + {a_{2}R_{1}} + a_{1}}$where the R_(i) are the radices, the a_(i) are the mixed-radix digits,and 0≦a_(i)<R_(i). For a given set of radices, the mixed-radixrepresentation of x is denoted by (a_(n), a_(n-1), . . . , a₁) where thedigits are listed in order of decreasing significance.” See Id. “Themultipliers of the digits a_(i) are the mixed-radix weights where theweight of a_(i) is

${\prod\limits_{j = 1}^{i - 1}\;{R_{j}\mspace{14mu}{for}\mspace{14mu} i}} \neq {1.\text{”}}$

For conversion from the RNS to a mixed-radix system, a set of moduli arechosen so that m_(i)=R_(i). A set of moduli are also chosen so that amixed-radix system and a RNS are said to be associated. “In this case,the associated systems have the same range of values, that is

$\prod\limits_{i = 1}^{N}\;{m_{i}.}$The mixed-radix conversion process described here may then be used toconvert from the [RNS] to the mixed-radix system.” See Id.

“If m_(i)=R_(i), then the mixed-radix expression is of the form:

$x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; m_{i}}} + \ldots + {a_{3}m_{1}m_{2}} + {a_{2}m_{1}} + a_{1}}$where a_(i) are the mixed-radix coefficients. The a_(i) are determinedsequentially in the following manner, starting with a₁.” See Id.

$x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; m_{i}}} + \ldots + {a_{3}m_{1}m_{2}} + {a_{2}m_{1}} + a_{1}}$is first taken modulo m₁. “Since all terms except the last are multiplesof m₁, we have

x

_(m) ₁ =a₁. Hence, a₁ is just the first residue digit.” See Id.

“To obtain a₂, one first forms x-a₁ in its residue code. The quantityx-a₁ is obviously divisible by m₁. Furthermore, m₁ is relatively primeto all other moduli, by definition. Hence, the division remainder zeroprocedure [Division where the dividend is known to be an integermultiple of the divisor and the divisor is known to be relatively primeto M] can be used to find the residue digits of order 2 through N of

$\frac{x - a_{1}}{m_{i}}.$Inspection of

$\left\lbrack {x = {{a_{N}{\prod\limits_{i = 1}^{N - 1}\; m_{i}}} + \ldots + {a_{3}m_{1}m_{2}} + {a_{2}m_{1}} + a_{1}}} \right\rbrack$shows then that x is a₂. In this way, by successive subtracting anddividing in residue notation, all of the mixed-radix digits may beobtained.” See Id.

“It is interesting to note that

${a_{1} = \left\langle x \right\rangle_{m_{1}}},{a_{2} = \left\langle \left\lfloor \frac{x}{m_{1}} \right\rfloor \right\rangle_{m_{2}}},{a_{3} = \left\langle \left\lfloor \frac{x}{m_{1}m_{2}} \right\rfloor \right\rangle_{m_{3}}}$and in general for i>1

$a_{i} = {\left\langle \left\lfloor \frac{x}{m_{1}m_{2}\mspace{14mu}\ldots\mspace{14mu} m_{i - 1}} \right\rfloor \right\rangle_{m_{i}}.\text{”}}$See Id. From the preceding description it is seen that the mixed-radixconversion process is iterative. The conversion can be modified to yielda truncated result. Still, the invention is not limited in this regard.

According to another embodiment of the invention, a Chinese remaindertheorem (CRT) arithmetic operation is used to map the RNS solutions Nos.1 through N to a weighted number system representation. The CRTarithmetic operation is well known in the art and therefore will not bedescribed here in detail. The first known formulation of the ChineseRemainder Theorem is attributed to Sunzi in his “Book of Arithmetics”circa 500 A.D. However, a brief discussion of how the CRT is applied maybe helpful for understanding the invention. The CRT arithmetic operationcan be defined by a mathematical Equation (4) [returning to zero (0)based indexing].

$\begin{matrix}{Y = \left\langle \begin{matrix}{\left\langle {\left\langle {\left\lbrack {{3\;{x_{0}^{3}\left( {\left( {n - 1} \right)T} \right)}} + {3\; x_{0}^{2}\left( {\left( {n - 1} \right)T} \right)} + {x_{0}\left( {\left( {n - 1} \right)T} \right)} + {C_{0}({nT})}} \right\rbrack b_{0}} \right\rangle_{p_{0}}\frac{M}{p_{0}}} \right\rangle_{M} + \ldots +} \\\left\langle {\left\langle {\left\lbrack {{3\;{x_{N - 1}^{3}\left( {\left( {n - 1} \right)T} \right)}} + {3\; x_{N - 1}^{2}\left( {\left( {n - 1} \right)T} \right)} + {x_{N - 1}\left( {\left( {n - 1} \right)T} \right)} + {C_{N - 1}({nT})}} \right\rbrack b_{N - 1}} \right\rangle_{p_{N - 1}}\frac{M}{p_{N - 1}}} \right\rangle_{M}\end{matrix} \right\rangle_{M}} & (4)\end{matrix}$Mathematical Equation (4) can be re-written as mathematical Equation(5).

$\begin{matrix}{Y = \left\langle \begin{matrix}{\left\langle {\left\langle {\left\lbrack {{3\;{x_{0}^{3}\left( {\left( {n - 1} \right)T} \right)}} + {3\; x_{0}^{2}\left( {\left( {n - 1} \right)T} \right)} + {x_{0}\left( {\left( {n - 1} \right)T} \right)} + {C_{0}({nT})}} \right\rbrack b_{0}} \right\rangle_{p_{0}}\frac{M}{p_{0}}} \right\rangle_{M} + \ldots +} \\\left\langle {\left\langle {\left\lbrack {{3\;{x_{N - 1}^{3}\left( {\left( {n - 1} \right)T} \right)}} + {3\; x_{N - 1}^{2}\left( {\left( {n - 1} \right)T} \right)} + {x_{N - 1}\left( {\left( {n - 1} \right)T} \right)} + {C_{N - 1}({nT})}} \right\rbrack b_{N - 1}} \right\rangle_{p_{N - 1}}\frac{M}{p_{N - 1}}} \right\rangle_{M}\end{matrix} \right\rangle_{M}} & (5)\end{matrix}$where Y is the result of the CRT arithmetic operation. n is a sampletime index value. T is a fixed constant having a value representing atime interval or increment. x₀-x_(N-1) are RNS solutions Nos. 1 throughN. p₀, p₁, . . . , p_(N-1) are prime numbers. M is a fixed constantdefined by a product of the relatively prime numbers p₀, p₁, . . . ,p_(N-1). b₀, b₁, . . . , b_(N-1) are fixed constants that are chosen asthe multiplicative inverses of the product of all other primes modulop₀, p₁, . . . , p_(N-1), respectively. Equivalently,

$b_{j} = {\left( \frac{M}{p_{j}} \right)^{- 1}{mod}\mspace{11mu}{p_{j}.}}$

The b_(j)'s enable an isomorphic mapping between an RNS N-tuple valuerepresenting a weighted number and the weighted number. However withoutloss of chaotic properties, the mapping need only be unique andisomorphic. As such, a weighted number x can map into a tuple y. Thetuple y can map into a weighted number z. The weighted number x is notequal to z as long as all tuples map into unique values for z in a rangefrom zero (0) to M-1. Thus for certain embodiments of the presentinvention, the b_(j)'s can be defined as

$b_{j} = {\left( \frac{M}{p_{j}} \right)^{- 1}{mod}\mspace{11mu}{p_{j}.}}$In other embodiments of the present invention, all b_(j)'s can be setequal to one or more non-zero values without loss of the chaoticproperties.

As should be appreciated, the chaotic sequence output Y can be expressedin a binary number system representation. As such, the chaotic sequenceoutput Y can be represented as a binary sequence. Each bit of the binarysequence has a zero (0) value or a one (1) value. The chaotic sequenceoutput Y can have a maximum bit length (MBL) defined by a mathematicalEquation (6).MBL=Ceiling[Log 2(M)]  (6)where M is the product of the relatively prime numbers p₀, p₁, . . . ,p_(N-1) selected as moduli m₀, m₁, . . . , m_(N-1). In this regard, itshould be appreciated the M represents a dynamic range of a CRTarithmetic operation. The phrase “dynamic range” as used herein refersto a maximum possible range of outcome values of a CRT arithmeticoperation. It should also be appreciated that the CRT arithmeticoperation generates a chaotic numerical sequence with a periodicityequal to the inverse of the dynamic range M. The dynamic range requiresa Ceiling[Log 2(M)] bit precision.

According to an embodiment of the invention, M equals three quadrillionfive hundred sixty-three trillion seven hundred sixty-two billion onehundred ninety-one million fifty-nine thousand five hundred twenty-three(3,563,762,191,059,523). By substituting the value of M into Equation(6), the bit length (BL) for a chaotic sequence output Y expressed in abinary system representation can be calculated as follows:BL=Ceiling[Log 2(3,563,762,191,059,523)=52 bits. As such, the chaoticsequence output Y is a fifty-two (52) bit binary sequence having aninteger value between zero (0) and three quadrillion five hundredsixty-three trillion seven hundred sixty-two billion one hundredninety-one million fifty-nine thousand five hundred twenty-two(3,563,762,191,059,522), inclusive. Still, the invention is not limitedin this regard. For example, chaotic sequence output Y can be a binarysequence representing a truncated portion of a value between zero (0)and M-1. In such a scenario, the chaotic sequence output Y can have abit length less than Ceiling[Log 2(M)]. It should be noted that whiletruncation affects the dynamic range of the system it has no effect onthe periodicity of a generated sequence.

As should be appreciated, the above-described chaotic sequencegeneration can be iteratively performed. In such a scenario, a feedbackmechanism (e.g., a feedback loop) can be provided so that a variable “x”of a polynomial equation can be selectively defined as a solutioncomputed in a previous iteration. Mathematical Equation (2) can berewritten in a general iterative form:f(x(nT)=Q(k)x³((n−1)T)+R(k)x²((n−1)T)+S(k)x((n−1)T)+C(k,L). For example,a fixed coefficient polynomial equation is selected as f(x(n·1ms))=3x³((n−1)·1 ms)+3x²((n−1)·1 ms)+x((n−1)·1 ms)+8 modulo 503. n is avariable having a value defined by an iteration being performed. x is avariable having a value allowable in a residue ring. In a firstiteration, n equals one (1) and x is selected as two (2) which isallowable in a residue ring. By substituting the value of n and x intothe stated polynomial equation f(x(nT)), a first solution having a valueforty-six one (46) is obtained. In a second iteration, n is incrementedby one and x equals the value of the first solution, i.e., forty-six(46) resulting in the solution 298, 410 mod 503 or one hundredthirty-one (131). In a third iteration, n is again incremented by oneand x equals the value of the second solution.

Referring now to FIG. 5, there is provided a flow diagram of a method500 for generating a chaotic sequence that is useful for understandingthe invention. As shown in FIG. 5, the method 500 begins with step 502and continues with step 504. In step 504, a plurality of polynomialequations f₀(x(nT)), . . . , f_(N-1)(x(nT)) are selected. In thisregard, it should be appreciated that the polynomial equationsf₀(x(nT)), . . . , f_(N-1)(x(nT)) can be selected as the same polynomialequation except for a different constant term or different polynomialequations. After step 504, step 506 is performed where a determinationfor each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) is madeas to which combinations of RNS moduli m₀, m₁, . . . , m_(N-1) used forarithmetic operations and respective constant values C₀, C₁, . . . ,C_(N-1) generate irreducible forms of each polynomial equationf₀(x(nT)), . . . , f_(N-1)(x(nT)). In step 508, a modulus is selectedfor each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) that isto be used for RNS arithmetic operations when solving the polynomialequation f₀(x(nT)), . . . , f_(N-1)(x(nT)). In this regard, it should beappreciated that the modulus is selected from the moduli identified instep 506. It should also be appreciated that a different modulus must beselected for each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)).

As shown in FIG. 5, the method 500 continues with a step 510. In step510, a constant C_(m) is selected for each polynomial equationf₀(x(nT)), . . . , f_(N-1)(x(nT)) for which a modulus is selected. Eachconstant C_(m) corresponds to the modulus selected for the respectivepolynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)). Each constantC_(m) is selected from among the possible constant values identified instep 506 for generating an irreducible form of the respective polynomialequation f₀(x(nT)), . . . , f_(N-1)(x(nT)).

After step 510, the method 500 continues with step 512. In step 512, avalue for time increment “T” is selected. Thereafter, an initial valuefor “x” is selected. In this regard, it should be appreciated that theinitial value for “x” can be any value allowable in a residue ring.Subsequently, step 516 is performed where RNS arithmetic operations areused to iteratively determine RNS solutions for each of the statedpolynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT)). In step 518, aseries of digits in a weighted number system are determined based in theRNS solutions. This step can involve performing a mixed radix arithmeticoperation or a CRT arithmetic operation using the RNS solutions toobtain a chaotic sequence output.

After step 518, the method 500 continues with a decision step 520. If achaos generator is not terminated (520:NO), then step 524 is performedwhere a value of “x” in each polynomial equation f₀(x(nT)), . . . ,f_(N-1)(x(nT)) is set equal to the RNS solution computed for therespective polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) in step516. Subsequently, the method 500 returns to step 516. If the chaosgenerator is terminated (520:YES), then step 522 is performed where themethod 500 ends.

A person skilled in the art will appreciate that the method 500 is onearchitecture of a method for generating a chaotic sequence. However, theinvention is not limited in this regard and any other method forgenerating a chaotic sequence can be used without limitation.

Referring now to FIG. 6, there is illustrated one embodiment of a chaosgenerator 218. The chaos generator 218 is comprised of hardware and/orsoftware configured to generate a digital chaotic sequence. In thisregard, it should be appreciated that the chaos generator 218 iscomprised of computing processors 602 ₀-602 _(N-1). The chaos generator218 is also comprised of a mapping processor 604. Each computingprocessor 602 ₀-602 _(N-1) is coupled to the mapping processor 604 by arespective data bus 606 ₀-606 _(N-1). As such, each computing processor602 ₀-602 _(N-1) is configured to communicate data to the mappingprocessor 604 via a respective data bus 606 ₀-606 _(N-1). The mappingprocessor 604 can be coupled to an external device (not shown) via adata bus 608. In this regard, it should be appreciated that the externaldevice (not shown) includes, but is not limited to, a communicationsdevice configured to combine or modify a signal in accordance with achaotic sequence output.

Referring again to FIG. 6, the computing processors 602 ₀-602 _(N-1) arecomprised of hardware and/or software configured to solve N polynomialequations f₀(x(nT)), . . . , f_(N-1)(x(nT)) to obtain a plurality ofsolutions. The N polynomial equations f₀(x(nT)), . . . , f_(N-1)(x(nT))can be irreducible polynomial equations having chaotic properties inGalois field arithmetic. Such irreducible polynomial equations include,but are not limited to, irreducible cubic polynomial equations andirreducible quadratic polynomial equations. The N polynomial equationsf₀(x(nT)) . . . f_(N-1)(x(nT)) can also be identical exclusive of aconstant value. The constant value can be selected so that a polynomialequation f₀(x(nT)), . . . , f_(N-1)(x(nT)) is irreducible for apredefined modulus. The N polynomial equations f₀(x(nT)), . . . ,f_(N-1)(x(nT)) can further be selected as a constant or varying functionof time.

Each of the solutions can be expressed as a unique residue number system(RNS) N-tuple representation. In this regard, it should be appreciatedthat the computing processors 602 ₀-602 _(N-1) employ modulo operationsto calculate a respective solution for each polynomial equationf₀(x(nT)), . . . , f_(N-1)(x(nT)) using modulo based arithmeticoperations. Each of the computing processors 602 ₀-602 _(N-1) arecomprised of hardware and/or software configured to utilize a differentrelatively prime number p₀, p₁, . . . , p_(N-1) as a moduli m₀, m₁, . .. , m_(N-1) for modulo based arithmetic operations. The computingprocessors 602 ₀-602 _(N-1) are also comprised of hardware and/orsoftware configured to utilize modulus m₀, m₁, . . . , m_(N-1) selectedfor each polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) so thateach polynomial equation f₀(x(nT)), . . . , f_(N-1)(x(nT)) isirreducible. The computing processors 602 ₀-602 _(N-1) are furthercomprised of hardware and/or software configured to utilize moduli m₀,m₁, . . . , m_(N-1) selected for each polynomial equation f₀(x(nT)), . .. , f_(N-1)(x(nT)) so that solutions iteratively computed via a feedbackmechanism 610 ₀-610 _(N-1) are chaotic. In this regard, it should beappreciated that the feedback mechanisms 610 ₀-610 _(N-1) are providedso that the solutions for each polynomial equation f₀(x(nT)), . . . ,f_(N-1)(x(nT)) can be iteratively computed. Accordingly, the feedbackmechanisms 610 ₀-610 _(N-1) are comprised of hardware and/or softwareconfigured to selectively define a variable “x” of a polynomial equationas a solution computed in a previous iteration.

Referring again to FIG. 6, the computing processors 602 ₀-602 _(N-1) arefurther comprised of hardware and/or software configured to express eachof the RNS residue values in a binary number system representation. Inthis regard, the computing processors 602 ₀-602 _(N-1) can employ anRNS-to-binary conversion method. Such methods are generally known topersons skilled in the art and therefore will not be described in greatdetail herein. However, it should be appreciated that any such methodcan be used without limitation. It should also be appreciated that theresidue values expressed in binary number system representations arehereinafter referred to as moduli solutions Nos. 1 through N comprisingthe elements of an RNS N-tuple.

According to an embodiment of the invention, the computing processors602 ₀-602 _(N-1) are further comprised of memory based tables (notshown) containing pre-computed residue values in a binary number systemrepresentation. The address space of each memory table is at least fromzero (0) to m_(m)-1 for all m, m₀ through m_(N-1). On each iteration,the table address is used to initiate the sequence. Still, the inventionis not limited in this regard.

Referring again to FIG. 6, the mapping processor 604 is comprised ofhardware and/or software configured to map the moduli (RNS N-tuple)solutions Nos. 1 through N to a weighted number system representation.The result is a series of digits in the weighted number system based onthe moduli solutions Nos. 1 through N. For example, the mappingprocessor 604 can be comprised of hardware and/or software configured todetermine the series of digits in the weighted number system based onthe RNS residue values using a Chinese Remainder Theorem process. Inthis regard, it will be appreciated by those skilled in the art that themapping processor 604 is comprised of hardware and/or softwareconfigured to identify a number in the weighted number system that isdefined by the moduli solutions Nos. 1 through N.

According to an aspect of the invention, the mapping processor 604 canbe comprised of hardware and/or software configured to identify atruncated portion of a number in the weighted number system that isdefined by the moduli solutions Nos. 1 through N. For example, themapping processor 604 can also be comprised of hardware and/or softwareconfigured to select the truncated portion to include any seriallyarranged set of digits of the number in the weighted number system.Further, the mapping processor 604 can include hardware and/or softwareconfigured to select the truncated portion to be exclusive of a mostsignificant digit when all possible weighted numbers represented by Pbits are not mapped, i.e., when M-1<2^(P). P is a fewest number of bitsrequired to achieve a binary representation of the weighted numbers.Still, the invention is not limited in this regard.

Referring again to FIG. 6, the mapping processor 604 is comprised ofhardware and/or software configured to express a chaotic sequence in abinary number system representation. In this regard, it should beappreciated that the mapping processor 604 can employ aweighted-to-binary conversion method. Such methods are generally knownto persons skilled in the art and therefore will not be described ingreat detail herein. However, it should be appreciated that any suchmethod can be used without limitation.

A person skilled in the art will appreciate that the digital chaosgenerator described in relation to FIGS. 1-6 is provided by way ofexample and is not intended to limit the invention. In this regard, thedigital chaos generator described herein is merely one architecture thatcan be used to implement a digital chaos generator in the variousinventive arrangements. Any other digital chaos generator architecturecan be used without limitation Likewise, any other suitable method ofgenerating digital chaos now known, or known in the future can be usedto implement the methods of the present invention.

Neighbor Discovery using Chaotic Sequence Spread Waveform

FIG. 7 is a diagram of a wireless ad-hoc network 700 that is useful forunderstanding the invention. Each circle in the diagram represents anode which can communicate with other nodes in the ad-hoc network. Thelines drawn between nodes represent communication links that are alreadyestablished in the ad-hoc network between various neighbor nodes. Inthis regard, it should be understood that these communication linksgenerally represent bidirectional wireless communications links throughwhich network data can be communicated from node to node. These linkscan be implemented using any communication protocol, including but notlimited to physical layer transmission using spread spectrum waveforms.

Each node in the network has the ability to communicate with other nodesin the network over some predetermined distance, which can depend upon avariety of factors, including transmitter power, processing gain,frequency re-use, antenna directivity, and environmental conditions. Anexemplary communication range 712 is shown for node 702. Thus, node 702is potentially able to communicate with nodes 704, 706, 708, and 710.Those skilled in the art will appreciate that the communication range712 is an idealized representation of an omni-directional pattern.However, it should be understood that the invention is not limited inthis regard.

In FIG. 7, it can be observed that node 702 has already establishedcommunication links with nodes 708, 710, but not nodes 704, 706.However, node 702 also has the ability to establish a communication linkwith node 704, 706. Such a communication link can be established by node702 transmitting a beacon signal to all nodes within communication range712. Such beacon signal can alert the neighboring nodes (including node704 and 706) that node 702 is present and available for establishing acommunication link.

The beacon signal advantageously includes beacon data. Beacon dataincludes various types of data useful for identifying neighbor nodes andestablishing communication links between such neighbor nodes in thead-hoc network. For example, it is known in the art that a beacon signalcan specify data network initialization parameters and/or networkcharacteristics. Such information advantageously includes routingtables, transmission rates in the network, transmission frequency,transmission time slots, transmission pattern, quality of service (QoS),acceptable bit error rates and/or available bandwidth. In the case of amobile ad-hoc network (MANET) the beacon can contain additionalinformation concerning movements of a group of nodes, node velocity,node acceleration and so on. Such information can be determined usingglobal positioning satellites (GPS) or other means. The foregoing listof beacon information is provided by way of example, and is not intendedto limit the scope of the invention.

FIG. 8 is a block diagram of an exemplary node 702 that is useful forunderstanding the invention. Each of the other nodes in ad-hoc network700 are advantageously selected to have a similar architecture or atleast similar functional capabilities. The node 702 includes a controlprocessor 802, network interface 804, memory 806, wireless transceiver808, wireless transceiver 810, antenna multiplexor 811, and data bus814. The node can also include up to two or more antennas 816, 818.

The node 702 shown in FIG. 8 is one illustrative embodiment of theinvention. This invention, may however, be embodied in many differentforms and should not be construed as limited to the embodiments setforth herein. Dedicated hardware implementations including, but notlimited to, application-specific integrated circuits, programmable logicarrays, and other hardware devices can be constructed to implement thenode 702 as described herein. Applications that can include theapparatus and systems of various embodiments broadly include a varietyof electronic and computer systems controlled by software or firmware.Some embodiments implement functions in two or more specificinterconnected hardware modules or devices with related control and datasignals communicated between and through the modules, or as portions ofan application-specific integrated circuit. Thus, the exemplary systemis applicable to software, firmware, and hardware implementations.

Referring again to FIG. 8, the control processor 802 can be any dataprocessing device suitable for controlling the operation of the node 702as shall hereinafter be described in further detail. For example, thecontrol processor 802 can be implemented as a microprocessor or centralprocessing unit (CPU) programmed with a set of instructions. The memory806 can be any suitable type of data storage device. For example thememory 806 can include a conventional random access memory (RAM), aread-only memory (ROM) device for storing data or instructions for thecontrol processor 802, and/or any other type of computer-readablemedium. Data can be communicated between control processor 802 andmemory 806 via a data bus 814.

The node 702 advantageously includes a network interface 804. Thenetwork interface 804 can be any combination of hardware and/or softwarethat implements network communications in accordance with a particularnetwork standard and protocol. Thus, the network interface 804 caninclude without limitation a serial line interface, an Ethernetinterface, an asynchronous transfer mode (ATM) network interface, and/oran interface to a local area network (LAN). In this regard, it will beappreciated that the disclosure is not limited to any particular networkstandards or protocols. Such standards are periodically superseded byfaster or more efficient equivalents having essentially the samefunctions. Accordingly, replacement standards and protocols having thesame functions are considered equivalents.

The node 702 also includes one or more wireless transceivers 808, 810.The one or more wireless transceivers 808, 810 communicate with othernodes in the ad-hoc network through one or more antennas 816, 818. Anantenna multiplexor 811 is advantageously provided for communicatingsignals to and from a selected antenna from a particular one of thewireless transceivers. Multiple antennas or antenna elements can beuseful for a variety of purposes in node 702. For example, one antenna816 can be a directional type antenna, whereas a second antenna 818 canbe an omni-directional type antenna. The directional type antenna can bemore suited for communications with specific nodes, whereas theomni-directional antenna is sometimes desirable for use with beaconsignal transmissions. Alternately, the second or additional antennas maybe used to simultaneously communicate on different frequency bands.Still, the invention is not limited in this regard, and one or bothantenna types can be used for beacon signal transmissions.

According to an embodiment of the invention, at least one of thewireless transceivers used for beacon signal transmissions includes atransmitter 102 and receiver 104 which function as previously describedin relation to FIGS. 1-6. Thus, at least one wireless transceiver 808,810 provided in each node implements a coherent chaotic spread-spectrumcommunication system for transmission and receiving of beacon signals.Thus at least one transceiver 808, 810 in each node is configured totransmit analog chaotic signals to other nodes via a wirelesscommunications link. Transceivers at receiving nodes are configured todown convert, digitize, and de-spread the transmitted analog chaoticsignal by correlating it with a replica of the chaotic sequencegenerated at the transmitter. The chaotic sequence in each node is timesynchronized to the chaotic sequence in the other nodes.

The distinction between conventional direct sequence spread spectrumsystems and chaotic spread spectrum communication is subtle, butimportant. Conventional direct sequence spread spectrum systems use adiscrete-time string of binary pseudorandom number (PN) code symbolscalled “chips” to phase modulate a carrier signal. The chips aregenerally of a much shorter duration as compared to each information bitof payload data to be transmitted. Since the rate of the PN code symbolsis much higher than the rate of the information bits, each informationbit is effectively modulated by the continuous string of PN codesymbols. The sequence of the PN code symbols is known a priori by boththe transmitter and receiver nodes. Accordingly, when the spreadspectrum signal is received by the receiver, it can be demodulated usingthe same PN code, usually with at least some processing gain.Significantly, however, in direct sequence spread spectrum systems thechips are comprised of a pseudorandom sequence of 1 and −1 values. Inother words, the amplitude of the chips does not generally vary fromthese two values. Quadrature implementations of direct sequence spreadspectrum modulation schemes also maintain a balanced phase betweensuccessive chips. Both implementations have the undesired effect ofgenerating characteristic features embedded within the signal that canbe used by an adversary for unintended detection and signal tracking.

From the foregoing, it will be appreciated that the conventionalapproach to direct sequence spread spectrum creates problems for beaconsignal transmissions, where it is desirable to maintain a lowprobability of detection and intercept. The PN sequence used in suchsystems is not truly random, but merely pseudo-random. This means thatthe resulting spread spectrum signal will inevitably includecyclo-stationary properties that can be detected and exploited byadversaries. In order to minimize the likelihood that suchcyclo-stationary features can be exploited, conventional direct sequencespread spectrum communications must utilize very low power levels whenthis conventional approach is used for beacon signals. This means thatsuch systems require very high processing gain, which is achieved bymaking the rate of the chipping sequence much higher than the data rate.However, such very high spread ratios inevitably lead to very low datarates.

In contrast to the conventional direct sequence spread spectrumapproach, the present invention utilizes a chaotic sequence generatorwhich generates a different type of chipping sequence. The chippingsequence is based on digital chaos generated by means such as that whichhas been previously described in relation to FIGS. 4-6. Notably, a trulychaotic chipping sequence, such as would be generated by the systemdescribed in FIGS. 4-6 is absent of cyclo-stationary features, andoffers low probability of detection and interception. Further, ratherthan merely relying upon a series of chips that are 1 or −1 in value,the sequence of chips used in the chaotic spreading sequence have valuesthat vary chaotically and can be essentially any magnitude.Consequently, the chaotic chipping sequence has a characteristic that isindistinguishable from white noise. In this regard, it should beunderstood that spread spectrum beacon signals generated using a chaoticspreading sequence as described appear to adversaries (any receiverwithout knowledge of the spreading sequence) as nothing more thanband-limited noise. The relative power level of the beacon signals cantherefore be increased without the same risk of exploitation as comparedto conventional direct sequence spread spectrum systems. This permits arelatively high data rate to be accommodated on the spread spectrumbeacon signal, thereby facilitating transmission of substantial amountsof beacon data as part of the beacon message. As a result, the detectednode may establish normal data network communications quickly, andthereby transition more rapidly to a higher data rate communicationslink. Summarizing, the use of a digitally generated chaotic spreadingsequence as described herein provides nodes with the ability to sendlarger amounts of data as compared to a beacon signal transmission thatmerely notifies neighbors that a node is present. This ability to sendlarger amounts of data provides (1) faster initiation of high-rate datacommunications, and (2) permits the use of fewer beacon signal bursts tolower detection probability.

The present invention can be used for neighbor discovery in any ad-hocwireless communication system where low probability ofintercept/detection is a desirable feature. A wide variety of neighbordiscovery methods are known in the art an the inventive arrangementsdescribed herein can be used to implement neighbor discoverytransmissions in all such systems whether now known or known in thefuture. For example, when a network has a large number of nodes, it isknown in the art that the most effective neighbor discovery routine is aperiphery-based approach where designated nodes on the periphery of thenetwork perform network acquisition processing for the entire network.

Beacon communications are well known in the wireless ad-hoc networkfield and the present invention can be used with all such wirelessad-hoc networks where beacon signals are used. Once a node receives abeacon signal, it can attempt to respond to the node from which thebeacon signal was initially sent to establish a communication link withthat node. Various types of authentication and handshake routines areknown in the art for permitting a node to respond to a beacon signal.All such authentication and handshake routines whether now known, orknown in the future, can be used with the present invention.

Finally, it should be noted that the use of chaotic spread spectrumcommunications need not be limited to use for transmission of the beaconsignal. Instead, the chaotic spread spectrum communications methods andsystems as described herein can also be used for various handshakes andcommunications generated in response to the beacon signal. It is furthercontemplated that following the beacon transmission, when a node isassociated with another node for purposes of network communications,such network communications can be performed using the chaotic spreadspectrum communication as described herein. However, the invention isnot limited in this regard, and the network communications subsequent tothe initial beacon or handshake can optionally be performed using othercommunications protocols that may offer still higher data rates.

All of the apparatus, methods and algorithms disclosed and claimedherein can be made and executed without undue experimentation in lightof the present disclosure. While the invention has been described interms of preferred embodiments, it will be apparent to those of skill inthe art that variations may be applied to the apparatus, methods andsequence of steps of the method without departing from the concept,spirit and scope of the invention. More specifically, it will beapparent that certain components may be added to, combined with, orsubstituted for the components described herein while the same orsimilar results would be achieved. All such similar substitutes andmodifications apparent to those skilled in the art are deemed to bewithin the spirit, scope and concept of the invention as defined.

1. A method for identifying neighbor nodes in an ad-hoc wireless networkincluding a plurality of nodes, comprising: generating a beacon signalat a first node of said network for alerting other nodes in said networkof the presence of said first node, said beacon signal comprising beacondata and having a data rate, said beacon data including informationspecifying at least one of a data initialization parameter and a networkcharacteristic that is useful for establishing a communication linkbetween said first node and said other nodes of said network; digitallygenerating a first chaotic spreading sequence at said first node;modulating said beacon signal with said first chaotic spreading sequenceto produce a spread spectrum beacon signal; and transmitting said spreadspectrum beacon signal at a first power level without risk of detection,wherein said first power level exceeds a second power level at which abeacon signal could be transmitted without risk of detection using anon-chaotic spreading code.
 2. The method according to claim 1, furthercomprising transmitting said spread spectrum beacon signal from saidfirst node in an omni-directional pattern.
 3. The method according toclaim 1, further comprising receiving said spread spectrum beacon signalwith at least a second node in said network and coherently demodulatingsaid spread spectrum beacon signal using a second chaotic spreadingsequence digitally generated at said second node to obtain said beaconsignal.
 4. The method according to claim 3, further comprising:identifying with said second node said first node as a neighbor nodebased on said beacon signal; and transmitting a message from said secondnode to said first node in response to said beacon signal.
 5. The methodaccording to claim 4, further comprising transmitting said message fromsaid second node to said first node using a directional antenna.
 6. Themethod according to claim 4, further comprising transmitting networkdata between said first and said second node exclusive of using saidfirst or second chaotic spreading sequence for modulating said networkdata following transmission of said beacon and said message.
 7. Themethod according to claim 1, wherein said beacon signal is modulated toinclude beacon data, exclusive of said first chaotic spreading sequence,identifying one or more communication protocols associated with saidad-hoc network.
 8. The method according to claim 7, wherein said beacondata includes one or more items selected from the comprising a datatransmission rate, a transmission frequency, a receive frequency, atransmission time, a transmission protocol, a quality of serviceparameter, a bit error rate parameter, an available bandwidth, aposition of a node, a node velocity, and a node acceleration.
 9. Themethod according to claim 1, wherein said first node is selected to havea location near a periphery of said network.
 10. The method according toclaim 1, wherein said step of generating said digitally generated firstchaotic spreading sequence further comprises: selecting a plurality ofpolynomial equations; using residue number system (RNS) arithmeticoperations to respectively determine a plurality of solutions for saidplurality of polynomial equations, said plurality of solutionsiteratively computed and expressed as RNS residue values.
 11. The methodaccording to claim 10, wherein said step of generating said digitallygenerated first chaotic spreading sequence further comprises determininga series of digits in a weighted number system based on said pluralityof RNS residue values.
 12. An ad-hoc network including a plurality ofnodes, comprising: a first node including a processor configured togenerate a beacon signal for alerting other nodes in said network of thepresence of said first node, said beacon signal comprising beacon dataand having a data rate, said beacon data including informationspecifying at least one of a data initialization parameter and a networkcharacteristic that is useful for establishing a communication linkbetween said first node and said other nodes of said network; a firstspreading sequence generator configured to digitally generate a firstchaotic spreading sequence; a first modulator configured to modulatesaid beacon signal with said first chaotic spreading sequence to producea spread spectrum beacon signal; and a first transmitter configured totransmit said spread spectrum beacon signal at a first power levelwithout risk of detection, wherein said first power level exceeds asecond power level at which a beacon signal could be transmitted withoutrisk of detection using a non-chaotic spreading code.
 13. The ad-hocnetwork according to claim 12, wherein said first node further comprisesa omni-directional antenna and said spread spectrum beacon signal isbroadcast from said omni-directional antenna.
 14. The ad-hoc networkaccording to claim 12, further comprising at least a second nodeincluding: a receiver configured to receive said spread spectrum beaconsignal; a second spreading sequence generator configured to digitallygenerate a second chaotic spreading sequence; and a demodulatorconfigured to demodulate said spread spectrum beacon signal using saidsecond chaotic spreading sequence to obtain said beacon signal.
 15. Thead-hoc network according to claim 14, wherein said second node furthercomprises: a second processor configured to identify said first node asa neighbor node based on said beacon signal and generating a message inresponse to said beacon signal; and a second transmitter responsive tosaid second processor and configured to transmit said message to saidfirst node.
 16. The ad-hoc network according to claim 15, wherein saidsecond node further comprises a directional antenna coupled to saidsecond transmitter for transmitting said message from said second nodeto said first node.
 17. The ad-hoc network according to claim 15,wherein following said transmission of said beacon signal and saidmessage, said first and second transmitter are configured to transmitnetwork data between said first and said second node exclusive of usingsaid first or second chaotic spreading sequence.
 18. The ad-hoc networkaccording to claim 12, wherein said first node further comprises abeacon signal modulator configured to modulate said beacon signal toinclude data, exclusive of said first chaotic spreading sequence, andidentifying one or more communication protocols associated with saidad-hoc network.
 19. The ad-hoc network according to claim 18, whereinsaid beacon data includes one or more items selected from the comprisinga data transmission rate, a transmission frequency, a receive frequency,a transmission time, a transmission protocol, a quality of serviceparameter, a bit error rate parameter, an available bandwidth, aposition of a node, a node velocity, and a node acceleration.
 20. Thead-hoc network according to claim 12, wherein said first node is locatedat or adjacent to a periphery of said network.
 21. The ad-hoc networkaccording to claim 12, wherein said first spreading sequence generatorcomprises a computing means configured to use residue number system(RNS) arithmetic operations to respectively determine a plurality ofsolutions for a plurality of polynomial equations, said plurality ofsolutions iteratively computed and expressed as RNS residue values. 22.The ad-hoc network according to claim 21, wherein said first spreadingsequence generator further comprises a mapping means configured todetermine a series of digits in a weighted number system based on saidplurality of RNS residue values.
 23. A network node for communicating inad-hoc network including a plurality of nodes, comprising: a processorconfigured to generate a beacon signal for alerting other nodes in saidnetwork of the presence of said network node, said beacon signalcomprising beacon data and having a data rate, said beacon dataincluding information specifying at least one of a data initializationparameter and a network characteristic that is useful for establishing acommunication link between said first node and said other nodes of saidnetwork; a first spreading sequence generator configured to digitallygenerate a first chaotic spreading sequence; a first modulatorconfigured to modulate said beacon signal with said first chaoticspreading sequence to produce a spread spectrum beacon signal; and afirst transmitter configured to transmit said spread spectrum beaconsignal at a first power level without risk of detection, wherein saidfirst power level exceeds a second power level at which a beacon signalcould be transmitted without risk of detection using a non-chaoticspreading code.
 24. The network node according to claim 23, wherein saidfirst node further comprises a beacon signal modulator configured tomodulate said beacon signal to include data, exclusive of said firstchaotic spreading sequence, and identifying one or more communicationprotocols associated with said ad-hoc network.
 25. The network nodeaccording to claim 24, wherein said beacon data includes one or moreitems selected from the comprising a data transmission rate, atransmission frequency, a receive frequency, a transmission time, atransmission protocol, a quality of service parameter, a bit error rateparameter, an available bandwidth, a position of a node, a nodevelocity, and a node acceleration.
 26. The ad-hoc network according toclaim 23, wherein said spreading sequence generator comprises acomputing means configured to use residue number system (RNS) arithmeticoperations to respectively determine a plurality of solutions for aplurality of polynomial equations, said plurality of solutionsiteratively computed and expressed as RNS residue values.
 27. The ad-hocnetwork according to claim 26, wherein said spreading sequence generatorfurther comprises a mapping means configured to determine a series ofdigits in a weighted number system based on said plurality of RNSresidue values.